main
leetcode-tsh
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2145.Count the Hidden Sequences\Solution.py
2 1 -
A
solution\0700-0799\0717.1-bit and 2-bit Characters\Solution.py
2 1 -
A
solution\0500-0599\0518.Coin Change II\Solution.ts
2 1 -
A
solution\0900-0999\0926.Flip String to Monotone Increasing\Solution.js
2 1 -
A
solution\2100-2199\2148.Count Elements With Strictly Smaller and Greater Elements\Solution.py
2 1 -
A
solution\2400-2499\2413.Smallest Even Multiple\Solution.java
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\2300-2399\2395.Find Subarrays With Equal Sum\Solution.ts
2 1 -
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.py
2 1 -
A
solution\2100-2199\2145.Count the Hidden Sequences\Solution.cpp
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\0900-0999\0918.Maximum Sum Circular Subarray\Solution.ts
2 1 -
A
solution\2400-2499\2449.Minimum Number of Operations to Make Arrays Similar\Solution.py
2 1 -
A
solution\0700-0799\0771.Jewels and Stones\Solution.ts
2 1 1
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.py
2 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.ts
2 1 -
A
solution\0400-0499\0423.Reconstruct Original Digits from English\Solution.py
2 1 -