main
leetcode-modula
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2448.Minimum Cost to Make Array Equal\Solution.py
3 1 1
A
solution\0400-0499\0449.Serialize and Deserialize BST\Solution.py
4 1 1
A
solution\0800-0899\0895.Maximum Frequency Stack\Solution.java
4 1 1
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.java
6 1 1
A
solution\0800-0899\0899.Orderly Queue\Solutioin.java
4 1 1
A
solution\0900-0999\0900.RLE Iterator\Solution.java
4 1 1
A
solution\0900-0999\0901.Online Stock Span\Solution.java
4 1 1
A
solution\0900-0999\0902.Numbers At Most N Given Digit Set\Solution.py
3 1 1
A
solution\0600-0699\0621.Task Scheduler\Solution.cs
3 1 1
A
solution\0300-0399\0379.Design Phone Directory\Solution.java
6 1 1
A
solution\0600-0699\0622.Design Circular Queue\Solution.java
11 1 1
A
solution\2400-2499\2484.Count Palindromic Subsequences\Solution.py
16 1 1
A
solution\0900-0999\0911.Online Election\Solution.java
6 1 1
A
solution\0900-0999\0912.Sort an Array\Solution.py
1 1 1
A
solution\0900-0999\0913.Cat and Mouse\Solutioin.py
18 1 1
A
solution\0900-0999\0913.Cat and Mouse\Solution.cpp
17 1 1
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.java
6 1 1
A
solution\2400-2499\2493.Divide Nodes Into the Maximum Number of Groups\Solution.cpp
16 1 1
A
solution\2500-2599\2502.Design Memory Allocator\Solution.java
7 1 1
A
solution\2500-2599\2505.Bitwise OR of All Subsequence Sums\Solution.java
6 1 1