main
leetcode-free-basic
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2100-2199\2186.Minimum Number of Steps to Make Two Strings Anagram II\Solution.js
3 1 -
A
solution\2100-2199\2186.Minimum Number of Steps to Make Two Strings Anagram II\Solution.ts
3 1 -
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.ts
3 1 -
A
solution\2400-2499\2436.Minimum Split Into Subarrays With GCD Greater Than One\Solution.cpp
3 1 -
A
solution\0500-0599\0519.Random Flip Matrix\Solution.java
3 1 -
A
solution\0700-0799\0752.Open the Lock\Solution.py
3 1 -
A
solution\0700-0799\0753.Cracking the Safe\Solution.cpp
3 1 -
A
solution\0500-0599\0519.Random Flip Matrix\Solution.py
3 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.cpp
3 1 -
A
solution\0500-0599\0530.Minimum Absolute Difference in BST\Solution.java
3 1 -
A
solution\2400-2499\2429.Minimize XOR\Solution.java
3 1 -
A
solution\2200-2299\2201.Count Artifacts That Can Be Extracted\Solution.py
3 1 -
A
solution\2200-2299\2207.Maximize Number of Subsequences in a String\Solution.cpp
3 1 -
A
solution\2200-2299\2207.Maximize Number of Subsequences in a String\Solution.java
3 1 -
A
solution\2500-2599\2551.Put Marbles in Bags\Solution.java
3 1 -
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.cpp
3 1 -
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.java
3 1 -
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.py
3 1 -
A
solution\0700-0799\0760.Find Anagram Mappings\Solution.java
3 1 -
A
solution\0700-0799\0763.Partition Labels\Solution.js
3 1 -