main
leetcode-c--
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0686.Repeated String Match\Solution.go
 1 -
A
solution\2000-2099\2031.Count Subarrays With More Ones Than Zeros\Solution.go
 1 -
A
solution\0500-0599\0500.Keyboard Row\Solution.cpp
0 1 -
A
solution\2000-2099\2032.Two Out of Three\Solution.go
 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.cpp
0 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.go
 1 -
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.go
 1 -
A
solution\0500-0599\0500.Keyboard Row\Solution.go
 1 -
A
solution\2000-2099\2034.Stock Price Fluctuation\Solution.go
 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.go
 1 -
A
solution\0600-0699\0688.Knight Probability in Chessboard\Solution.cpp
0 1 -
A
solution\0600-0699\0688.Knight Probability in Chessboard\Solution.go
 1 -
A
solution\2000-2099\2036.Maximum Alternating Subarray Sum\Solution.go
 1 -
A
solution\2000-2099\2037.Minimum Number of Moves to Seat Everyone\Solution.go
 1 -
A
solution\0500-0599\0501.Find Mode in Binary Search Tree\Solution.cpp
0 1 -
A
solution\0600-0699\0689.Maximum Sum of 3 Non-Overlapping Subarrays\Solution.cpp
0 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.go
 1 -
A
solution\0500-0599\0501.Find Mode in Binary Search Tree\Solution.go
 1 -
A
solution\0600-0699\0689.Maximum Sum of 3 Non-Overlapping Subarrays\Solution.go
 1 -
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.go
 1 -