main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2265.Count Nodes Equal to Average of Subtree\Solution.cpp
4 1 -
A
solution\0800-0899\0895.Maximum Frequency Stack\Solution.cpp
4 1 -
A
solution\2200-2299\2279.Maximum Bags With Full Capacity of Rocks\Solution.cpp
4 1 -
A
solution\0800-0899\0895.Maximum Frequency Stack\Solution.java
4 1 1
A
solution\2500-2599\2512.Reward Top K Students\Solution.ts
4 1 -
A
solution\0400-0499\0449.Serialize and Deserialize BST\Solution.py
4 1 1
A
solution\0800-0899\0895.Maximum Frequency Stack\Solution.py
4 1 -
A
solution\0800-0899\0898.Bitwise ORs of Subarrays\Solution.cpp
4 1 -
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.ts
4 1 -
A
solution\0800-0899\0898.Bitwise ORs of Subarrays\Solution.java
4 1 -
A
solution\0800-0899\0899.Orderly Queue\Solutioin.java
4 1 1
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.cpp
4 1 -
A
solution\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.cpp
4 1 -
A
solution\0800-0899\0899.Orderly Queue\Solution.cpp
4 1 -
A
solution\0900-0999\0900.RLE Iterator\Solution.java
4 1 1
A
solution\0600-0699\0629.K Inverse Pairs Array\Solution.cpp
4 1 -
A
solution\0900-0999\0900.RLE Iterator\Solution.py
4 1 -
A
solution\0900-0999\0901.Online Stock Span\Solution.cpp
4 1 -
A
solution\0600-0699\0629.K Inverse Pairs Array\Solution.java
4 1 -
A
solution\0900-0999\0901.Online Stock Span\Solution.java
4 1 1