main
leetcode-rockstar
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0623.Add One Row to Tree\Solution.java
5 1 -
A
solution\2400-2499\2411.Smallest Subarrays With Maximum Bitwise OR\Solution.java
5 1 -
A
solution\2400-2499\2409.Count Days Spent Together\Solution.cpp
5 1 -
A
solution\0800-0899\0893.Groups of Special-Equivalent Strings\Solution.cpp
5 1 -
A
solution\0800-0899\0896.Monotonic Array\Solution.js
5 1 -
A
solution\0800-0899\0896.Monotonic Array\Solution.ts
5 1 -
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.ts
5 1 -
A
solution\0900-0999\0900.RLE Iterator\Solution.cpp
5 1 -
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.java
5 1 -
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.java
5 1 -
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.cpp
5 1 -
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.cpp
5 1 -
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.cpp
5 1 -
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.ts
5 1 -
A
solution\2200-2299\2259.Remove Digit From Number to Maximize Result\Solution.cpp
5 1 -
A
solution\0900-0999\0907.Sum of Subarray Minimums\Solution.ts
5 1 -
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.java
5 1 -
A
solution\2200-2299\2259.Remove Digit From Number to Maximize Result\Solution.java
5 1 -
A
solution\0400-0499\0454.4Sum II\Solution.cpp
5 1 -
A
solution\0600-0699\0633.Sum of Square Numbers\Solution.cpp
5 1 -