main
leetcode-nushell
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2500-2599\2536.Increment Submatrices by One\Solution.go
 1 -
A
solution\0400-0499\0450.Delete Node in a BST\Solution.go
 1 -
A
solution\0600-0699\0636.Exclusive Time of Functions\Solution.go
 1 -
A
solution\2500-2599\2537.Count the Number of Good Subarrays\Solution.go
 1 -
A
solution\0900-0999\0926.Flip String to Monotone Increasing\Solution.go
 1 -
A
solution\2500-2599\2538.Difference Between Maximum and Minimum Price Sum\Solution.go
 1 -
A
solution\0900-0999\0927.Three Equal Parts\Solution.go
 1 -
A
solution\2500-2599\2539.Count the Number of Good Subsequences\Solution.go
 1 -
A
solution\2500-2599\2540.Minimum Common Value\Solution.go
 1 -
A
solution\0900-0999\0928.Minimize Malware Spread II\Solution.go
 1 -
A
solution\0600-0699\0637.Average of Levels in Binary Tree\Solution.go
 1 -
A
solution\2500-2599\2541.Minimum Operations to Make Array Equal II\Solution.go
 1 -
A
solution\2500-2599\2542.Maximum Subsequence Score\Solution.go
 1 -
A
solution\2500-2599\2543.Check if Point Is Reachable\Solution.go
 1 -
A
solution\0900-0999\0930.Binary Subarrays With Sum\Solution.go
 1 -
A
solution\2500-2599\2547.Minimum Cost to Split an Array\Solution.go
 1 -
A
solution\0400-0499\0451.Sort Characters By Frequency\Solution.go
 1 -
A
solution\0600-0699\0638.Shopping Offers\Solution.go
 1 -
A
solution\2500-2599\2548.Maximum Price to Fill a Bag\Solution.go
 1 -
A
solution\0900-0999\0931.Minimum Falling Path Sum\Solution.go
 1 -