main
leetcode-g-forth
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0861.Score After Flipping Matrix\Solution.ts
5 1 -
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.java
5 1 -
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.cpp
5 1 -
A
solution\2100-2199\2191.Sort the Jumbled Numbers\Solution.py
5 1 -
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.cpp
5 1 -
A
solution\2200-2299\2259.Remove Digit From Number to Maximize Result\Solution.cpp
5 1 -
A
solution\0800-0899\0865.Smallest Subtree with all the Deepest Nodes\Solution.java
5 1 -
A
solution\2200-2299\2259.Remove Digit From Number to Maximize Result\Solution.java
5 1 -
A
solution\2000-2099\2023.Number of Pairs of Strings With Concatenation Equal to Target\Solution.cpp
5 1 -
A
solution\0800-0899\0866.Prime Palindrome\Solution.py
5 1 -
A
solution\0800-0899\0869.Reordered Power of 2\Solution.cpp
5 1 -
A
solution\0800-0899\0869.Reordered Power of 2\Solution.java
5 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.cpp
5 1 -
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.java
5 1 -
A
solution\2300-2399\2391.Minimum Amount of Time to Collect Garbage\Solution.cpp
5 1 -
A
solution\0400-0499\0445.Add Two Numbers II\Solution.ts
5 1 -
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.cpp
5 1 -
A
solution\0600-0699\0605.Can Place Flowers\Solution.cpp
5 1 -
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.py
5 1 -
A
solution\2300-2399\2389.Longest Subsequence With Limited Sum\Solution.ts
5 1 -