main
leetcode-elixir
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2054.Two Best Non-Overlapping Events\Solution.java
6 1 -
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.java
6 1 -
A
solution\2400-2499\2444.Count Subarrays With Fixed Bounds\Solution.py
6 1 -
A
solution\0800-0899\0813.Largest Sum of Averages\Solution.cpp
6 1 -
A
solution\0200-0299\0296.Best Meeting Point\Solution.java
6 1 -
A
solution\0800-0899\0860.Lemonade Change\Solution.java
6 1 -
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.java
6 1 -
A
solution\0600-0699\0659.Split Array into Consecutive Subsequences\Solution.py
6 1 -
A
solution\2000-2099\2058.Find the Minimum and Maximum Number of Nodes Between Critical Points\Solution.py
6 1 -
A
solution\0600-0699\0664.Strange Printer\Solution.cpp
6 1 -
A
solution\0800-0899\0839.Similar String Groups\Solution.py
6 1 1
A
solution\0600-0699\0664.Strange Printer\Solution.java
6 1 -
A
solution\0600-0699\0664.Strange Printer\Solution.py
6 1 -
A
solution\0600-0699\0666.Path Sum IV\Solution.cpp
6 1 -
A
solution\0600-0699\0666.Path Sum IV\Solution.java
6 1 -
A
solution\0700-0799\0734.Sentence Similarity\Solution.py
6 1 -
A
solution\0400-0499\0467.Unique Substrings in Wraparound String\Solution.cpp
6 1 -
A
solution\0600-0699\0670.Maximum Swap\Solution.java
6 1 -
A
solution\0300-0399\0379.Design Phone Directory\Solution.java
6 1 1
A
solution\0600-0699\0670.Maximum Swap\Solution.ts
6 1 -