main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2135.Count Words Obtained After Adding a Letter\Solution.py
7 1 -
A
solution\0700-0799\0734.Sentence Similarity\Solution.cpp
7 1 -
A
solution\2500-2599\2511.Maximum Enemy Forts That Can Be Captured\Solution.java
7 1 -
A
solution\0700-0799\0734.Sentence Similarity\Solution.java
7 1 -
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.cpp
7 1 -
A
solution\0300-0399\0394.Decode String\Solution.java
7 1 -
A
solution\0700-0799\0738.Monotone Increasing Digits\Solution.cpp
7 1 -
A
solution\2400-2499\2459.Sort Array by Moving Items to Empty Space\Solution.cpp
7 1 -
A
solution\0700-0799\0738.Monotone Increasing Digits\Solution.java
7 1 1
A
solution\0700-0799\0738.Monotone Increasing Digits\Solution.py
7 1 -
A
solution\2100-2199\2155.All Divisions With the Highest Score of a Binary Array\Solution.java
7 1 -
A
solution\2100-2199\2161.Partition Array According to Given Pivot\Solution.cpp
7 1 -
A
solution\2100-2199\2161.Partition Array According to Given Pivot\Solution.java
7 1 -
A
solution\2400-2499\2400.Number of Ways to Reach a Position After Exactly k Steps\Solution.java
7 1 -
A
solution\2100-2199\2168.Unique Substrings With Equal Digit Frequency\Solution.py
7 1 -
A
solution\2400-2499\2449.Minimum Number of Operations to Make Arrays Similar\Solution.java
7 1 -
A
solution\2100-2199\2170.Minimum Operations to Make the Array Alternating\Solution.ts
7 1 -
A
solution\2500-2599\2511.Maximum Enemy Forts That Can Be Captured\Solution.py
7 1 -
A
solution\0500-0599\0514.Freedom Trail\Solution.cpp
7 1 -
A
solution\2100-2199\2191.Sort the Jumbled Numbers\Solution.java
7 1 -