main
leetcode-elixir
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2457.Minimum Addition to Make Integer Beautiful\Solution.py
3 1 -
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.java
3 1 -
A
solution\2100-2199\2181.Merge Nodes in Between Zeros\Solution.java
3 1 -
A
solution\2100-2199\2181.Merge Nodes in Between Zeros\Solution.ts
3 1 -
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.py
3 1 -
A
solution\2400-2499\2451.Odd String Difference\Solution.ts
3 1 -
A
solution\0300-0399\0341.Flatten Nested List Iterator\Solution.ts
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\0500-0599\0519.Random Flip Matrix\Solution.py
3 1 -
A
solution\0700-0799\0753.Cracking the Safe\Solution.cpp
3 1 -
A
solution\2500-2599\2562.Find the Array Concatenation Value\Solution.java
3 1 -
A
solution\2500-2599\2548.Maximum Price to Fill a Bag\Solution.java
3 1 -
A
solution\2500-2599\2548.Maximum Price to Fill a Bag\Solution.cpp
3 1 -
A
solution\2500-2599\2535.Difference Between Element Sum and Digit Sum of an Array\Solution.cpp
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\0700-0799\0760.Find Anagram Mappings\Solution.java
3 1 -
A
solution\0700-0799\0763.Partition Labels\Solution.js
3 1 -
A
solution\2400-2499\2439.Minimize Maximum of Array\Solution.py
3 1 -