main
leetcode-modula
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.py
2 1 -
A
solution\0700-0799\0756.Pyramid Transition Matrix\Solution.py
2 1 -
A
solution\2100-2199\2145.Count the Hidden Sequences\Solution.java
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.java
2 1 -
A
solution\2400-2499\2418.Sort the People\Solution.cpp
2 1 -
A
solution\2400-2499\2414.Length of the Longest Alphabetical Continuous Substring\Solution.ts
2 1 -
A
solution\2400-2499\2405.Optimal Partition of String\Solution.ts
2 1 -
A
solution\2400-2499\2401.Longest Nice Subarray\Solution.ts
2 1 -
A
solution\0300-0399\0304.Range Sum Query 2D - Immutable\Solution.ts
2 1 -
A
solution\0400-0499\0400.Nth Digit\Solution.cpp
2 1 -
A
solution\2300-2399\2395.Find Subarrays With Equal Sum\Solution.ts
2 1 -
A
solution\0400-0499\0400.Nth Digit\Solution.java
2 1 -
A
solution\0400-0499\0400.Nth Digit\Solution.py
2 1 -
A
solution\0900-0999\0940.Distinct Subsequences II\Solution.cpp
2 1 -
A
solution\0700-0799\0784.Letter Case Permutation\Solution.ts
2 1 -
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.cpp
2 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.py
2 1 -
A
solution\2100-2199\2134.Minimum Swaps to Group All 1's Together II\Solution.ts
2 1 -
A
solution\0300-0399\0309.Best Time to Buy and Sell Stock with Cooldown\Solution.java
2 1 -
A
solution\2100-2199\2111.Minimum Operations to Make the Array K-Increasing\Solution.py
2 1 -