main
leetcode-j
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2500-2599\2537.Count the Number of Good Subarrays\Solution.py
4 1 -
A
solution\0900-0999\0926.Flip String to Monotone Increasing\Solution.java
6 1 -
A
solution\2500-2599\2538.Difference Between Maximum and Minimum Price Sum\Solution.go
 1 -
A
solution\0300-0399\0360.Sort Transformed Array\Solution.go
 1 -
A
solution\2500-2599\2538.Difference Between Maximum and Minimum Price Sum\Solution.py
2 1 -
A
solution\0900-0999\0927.Three Equal Parts\Solution.go
 1 -
A
solution\2500-2599\2539.Count the Number of Good Subsequences\Solution.java
11 1 -
A
solution\0600-0699\0656.Coin Path\Solution.go
 1 -
A
solution\1000-1099\1000.Minimum Cost to Merge Stones\Solution.cpp
8 1 -
A
solution\1000-1099\1000.Minimum Cost to Merge Stones\Solution.go
 1 -
A
solution\0500-0599\0504.Base 7\Solution.java
4 1 -
A
solution\0600-0699\0685.Redundant Connection II\Solution.py
11 1 -
A
solution\1000-1099\1000.Minimum Cost to Merge Stones\Solution.java
10 1 -
A
solution\1000-1099\1001.Grid Illumination\Solution.cpp
15 1 -
A
solution\0600-0699\0686.Repeated String Match\Solution.cpp
0 1 -
A
solution\1000-1099\1001.Grid Illumination\Solution.go
 1 -
A
solution\1000-1099\1001.Grid Illumination\Solution.java
19 1 -
A
solution\0400-0499\0414.Third Maximum Number\Solution.go
 1 -
A
solution\0500-0599\0504.Base 7\Solution.ts
4 1 -
A
solution\0600-0699\0686.Repeated String Match\Solution.go
 1 -