main
leetcode-rect
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2500-2599\2597.The Number of Beautiful Subsets\Solution.ts
5 1 -
A
solution\0900-0999\0962.Maximum Width Ramp\Solution.java
8 1 -
A
solution\2500-2599\2598.Smallest Missing Non-negative Integer After Operations\Solution.java
4 1 -
A
solution\0300-0399\0386.Lexicographical Numbers\Solution.js
3 1 -
A
solution\2500-2599\2599.Make the Prefix Sum Non-negative\Solution.go
 1 -
A
solution\0900-0999\0966.Vowel Spellchecker\Solution.go
 1 -
A
solution\2500-2599\2599.Make the Prefix Sum Non-negative\Solution.ts
3 1 -
A
solution\0600-0699\0661.Image Smoother\Solution.cpp
0 1 -
A
solution\0400-0499\0498.Diagonal Traverse\Solution.cpp
0 1 -
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.py
2 1 -
A
solution\2000-2099\2034.Stock Price Fluctuation\Solution.go
 1 -
A
solution\2000-2099\2034.Stock Price Fluctuation\Solution.py
8 1 -
A
solution\0300-0399\0399.Evaluate Division\Solution.cpp
0 1 -
A
solution\0400-0499\0498.Diagonal Traverse\Solution.go
 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.cpp
12 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.go
 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.java
9 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.py
9 1 -
A
solution\0400-0499\0498.Diagonal Traverse\Solution.java
8 1 -
A
solution\2000-2099\2036.Maximum Alternating Subarray Sum\Solution.cpp
2 1 -