main
leetcode-fortran
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2138.Divide a String Into Groups of Size k\Solution.go
 1 -
A
solution\2100-2199\2139.Minimum Moves to Reach Target Score\Solution.go
 1 -
A
solution\2100-2199\2140.Solving Questions With Brainpower\Solution.cpp
0 1 -
A
solution\0700-0799\0724.Find Pivot Index\Solution.cpp
0 1 -
A
solution\2100-2199\2140.Solving Questions With Brainpower\Solution.go
 1 -
A
solution\0300-0399\0308.Range Sum Query 2D - Mutable\Solution.go
 1 -
A
solution\2100-2199\2144.Minimum Cost of Buying Candies With Discount\Solution.cpp
0 1 -
A
solution\0500-0599\0516.Longest Palindromic Subsequence\Solution.cpp
0 1 -
A
solution\0700-0799\0724.Find Pivot Index\Solution.go
 1 -
A
solution\2100-2199\2144.Minimum Cost of Buying Candies With Discount\Solution.go
 1 -
A
solution\2100-2199\2145.Count the Hidden Sequences\Solution.cpp
0 1 -
A
solution\0500-0599\0516.Longest Palindromic Subsequence\Solution.go
 1 -
A
solution\2100-2199\2145.Count the Hidden Sequences\Solution.go
 1 -
A
solution\2100-2199\2146.K Highest Ranked Items Within a Price Range\Solution.cpp
0 1 -
A
solution\2100-2199\2146.K Highest Ranked Items Within a Price Range\Solution.go
 1 -
A
solution\0400-0499\0409.Longest Palindrome\Solution.cpp
0 1 -
A
solution\2100-2199\2147.Number of Ways to Divide a Long Corridor\Solution.cpp
0 1 -
A
solution\2100-2199\2147.Number of Ways to Divide a Long Corridor\Solution.go
 1 -
A
solution\2100-2199\2148.Count Elements With Strictly Smaller and Greater Elements\Solution.cpp
0 1 -
A
solution\0700-0799\0728.Self Dividing Numbers\Solution.cpp
0 1 -