main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0396.Rotate Function\Solution.java
3 1 -
A
solution\2100-2199\2136.Earliest Possible Day of Full Bloom\Solution.cpp
3 1 -
A
solution\2400-2499\2448.Minimum Cost to Make Array Equal\Solution.py
3 1 1
A
solution\2100-2199\2136.Earliest Possible Day of Full Bloom\images\Solution.java
3 1 -
A
solution\2100-2199\2138.Divide a String Into Groups of Size k\Solution.java
3 1 -
A
solution\2400-2499\2457.Minimum Addition to Make Integer Beautiful\Solution.py
3 1 -
A
solution\2100-2199\2144.Minimum Cost of Buying Candies With Discount\Solution.java
3 1 -
A
solution\2100-2199\2149.Rearrange Array Elements by Sign\Solution.java
3 1 -
A
solution\2100-2199\2149.Rearrange Array Elements by Sign\Solution.ts
3 1 -
A
solution\2400-2499\2442.Count Number of Distinct Integers After Reverse Operations\Solution.cpp
3 1 -
A
solution\2400-2499\2441.Largest Positive Integer That Exists With Its Negative\Solution.cpp
3 1 -
A
solution\2400-2499\2439.Minimize Maximum of Array\Solution.py
3 1 -
A
solution\2400-2499\2436.Minimum Split Into Subarrays With GCD Greater Than One\Solution.ts
3 1 -
A
solution\2400-2499\2436.Minimum Split Into Subarrays With GCD Greater Than One\Solution.cpp
3 1 -
A
solution\2400-2499\2435.Paths in Matrix Whose Sum Is Divisible by K\Solution.ts
3 1 -
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.java
3 1 -
A
solution\2100-2199\2178.Maximum Split of Positive Even Integers\Solution.cpp
3 1 -
A
solution\2100-2199\2178.Maximum Split of Positive Even Integers\Solution.java
3 1 -
A
solution\2400-2499\2445.Number of Nodes With Value One\Solution.py
3 1 -
A
solution\2100-2199\2181.Merge Nodes in Between Zeros\Solution.java
3 1 -