main
leetcode-tcsh
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2600-2699\2604.Minimum Time to Eat All Grains\Solution.go
 1 -
A
solution\0900-0999\0959.Regions Cut By Slashes\Solution.cpp
13 1 -
A
solution\2600-2699\2604.Minimum Time to Eat All Grains\Solution.py
1 1 -
A
solution\0600-0699\0652.Find Duplicate Subtrees\Solution.py
1 1 -
A
solution\2600-2699\2605.Form Smallest Number From Two Digit Arrays\Solution.cpp
4 1 -
A
solution\0900-0999\0959.Regions Cut By Slashes\Solution.java
12 1 -
A
solution\2600-2699\2605.Form Smallest Number From Two Digit Arrays\Solution.java
4 1 -
A
solution\0300-0399\0376.Wiggle Subsequence\Solution.cpp
4 1 -
A
solution\0300-0399\0385.Mini Parser\Solution.py
11 1 -
A
solution\0400-0499\0484.Find Permutation\Solution.cpp
4 1 -
A
solution\0600-0699\0688.Knight Probability in Chessboard\Solution.go
 1 -
A
solution\2000-2099\2043.Simple Bank System\Solution.cpp
10 1 -
A
solution\0600-0699\0688.Knight Probability in Chessboard\Solution.java
10 1 -
A
solution\2000-2099\2043.Simple Bank System\Solution.go
 1 -
A
solution\0400-0499\0484.Find Permutation\Solution.go
 1 -
A
solution\2000-2099\2043.Simple Bank System\Solution.py
10 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.cpp
5 1 -
A
solution\0600-0699\0688.Knight Probability in Chessboard\Solution.ts
8 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\Solution.go
 1 -
A
solution\0900-0999\0960.Delete Columns to Make Sorted III\Solution.cpp
7 1 -