main
leetcode-idris
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0590.N-ary Tree Postorder Traversal\Solution.py
4 1 -
A
solution\0400-0499\0441.Arranging Coins\Solution.cpp
4 1 -
A
solution\2000-2099\2022.Convert 1D Array Into 2D Array\Solution.java
4 1 -
A
solution\0800-0899\0856.Score of Parentheses\Solution.java
4 1 -
A
solution\0300-0399\0376.Wiggle Subsequence\Solution.java
4 1 -
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.cpp
4 1 -
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.java
4 1 -
A
solution\0800-0899\0860.Lemonade Change\Solution.ts
4 1 -
A
solution\2000-2099\2046.Sort Linked List Already Sorted Using Absolute Values\Solution.cpp
4 1 -
A
solution\0500-0599\0593.Valid Square\Solution.py
4 1 -
A
solution\0500-0599\0594.Longest Harmonious Subsequence\Solution.cpp
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.java
4 1 -
A
solution\2200-2299\2270.Number of Ways to Split Array\Solution.java
4 1 -
A
solution\0500-0599\0594.Longest Harmonious Subsequence\Solution.java
4 1 -
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.py
4 1 1
A
solution\2400-2499\2438.Range Product Queries of Powers\Solution.cpp
4 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.java
4 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.py
4 1 -
A
solution\2100-2199\2195.Append K Integers With Minimal Sum\Solution.cpp
4 1 -
A
solution\2000-2099\2054.Two Best Non-Overlapping Events\Solution.py
4 1 -