main
leetcode-tsh
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0564.Find the Closest Palindrome\Solution.java
8 1 -
A
solution\2300-2399\2337.Move Pieces to Obtain a String\Solution.py
12 1 -
A
solution\0800-0899\0814.Binary Tree Pruning\Solution.go
 1 -
A
solution\0300-0399\0385.Mini Parser\Solution.ts
13 1 -
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.java
11 1 -
A
solution\0800-0899\0814.Binary Tree Pruning\Solution.ts
3 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.cpp
9 1 -
A
solution\0500-0599\0565.Array Nesting\Solution.cpp
3 1 -
A
solution\0900-0999\0902.Numbers At Most N Given Digit Set\Solution.cpp
15 1 -
A
solution\0400-0499\0467.Unique Substrings in Wraparound String\Solution.go
 1 -
A
solution\0600-0699\0634.Find the Derangement of An Array\Solution.cpp
2 1 -
A
solution\0900-0999\0902.Numbers At Most N Given Digit Set\Solution.go
 1 -
A
solution\0600-0699\0634.Find the Derangement of An Array\Solution.java
2 1 -
A
solution\0900-0999\0902.Numbers At Most N Given Digit Set\Solution.java
18 1 -
A
solution\0900-0999\0904.Fruit Into Baskets\Solution.cpp
4 1 -
A
solution\0300-0399\0395.Longest Substring with At Least K Repeating Characters\Solution.go
 1 -
A
solution\0400-0499\0467.Unique Substrings in Wraparound String\Solution.java
5 1 -
A
solution\0600-0699\0635.Design Log Storage System\Solution.cpp
6 1 -
A
solution\0900-0999\0904.Fruit Into Baskets\Solution.go
 1 -
A
solution\0900-0999\0904.Fruit Into Baskets\Solution.java
4 1 -