main
leetcode-fortran
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0395.Longest Substring with At Least K Repeating Characters\Solution.cpp
0 1 -
A
solution\0400-0499\0496.Next Greater Element I\Solution.go
 1 -
A
solution\0600-0699\0684.Redundant Connection\Solution.go
 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\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\0300-0399\0395.Longest Substring with At Least K Repeating Characters\Solution.go
 1 -
A
solution\0600-0699\0685.Redundant Connection II\Solution.cpp
0 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.go
 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.cpp
0 1 -
A
solution\0600-0699\0685.Redundant Connection II\Solution.go
 1 -
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.go
 1 -
A
solution\0600-0699\0686.Repeated String Match\Solution.cpp
0 1 -
A
solution\0400-0499\0497.Random Point in Non-overlapping Rectangles\Solution.cpp
0 1 3
A
solution\0600-0699\0686.Repeated String Match\Solution.go
 1 -
A
solution\2000-2099\2043.Simple Bank System\Solution.go
 1 -
A
solution\0400-0499\0497.Random Point in Non-overlapping Rectangles\Solution.go
 1 -
A
solution\2000-2099\2044.Count Number of Maximum Bitwise-OR Subsets\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 -