main
leetcode-elixir
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.cpp
10 1 -
A
solution\0800-0899\0807.Max Increase to Keep City Skyline\Solution.java
5 1 -
A
solution\2300-2399\2338.Count the Number of Ideal Arrays\Solution.java
11 1 -
A
solution\0500-0599\0547.Number of Provinces\Solution.py
3 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.cpp
9 1 -
A
solution\0800-0899\0808.Soup Servings\Solution.cpp
7 1 -
A
solution\2300-2399\2340.Minimum Adjacent Swaps to Make a Valid Array\Solution.java
10 1 -
A
solution\2300-2399\2398.Maximum Number of Robots Within Budget\Solution.cpp
7 1 -
A
solution\2400-2499\2423.Remove Letter To Equalize Frequency\Solution.go
 1 -
A
solution\2400-2499\2423.Remove Letter To Equalize Frequency\Solution.cpp
7 1 -
A
solution\2300-2399\2387.Median of a Row Wise Sorted Matrix\Solution.cpp
5 1 -
A
solution\2300-2399\2380.Time Needed to Rearrange a Binary String\Solution.java
4 1 -
A
solution\2300-2399\2375.Construct Smallest Number From DI String\Solution.java
12 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.py
5 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.java
6 1 -
A
solution\0200-0299\0295.Find Median from Data Stream\Solution.cpp
5 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.java
5 1 -
A
solution\0300-0399\0386.Lexicographical Numbers\Solution.java
5 1 -
A
solution\0400-0499\0486.Predict the Winner\Solution.cpp
5 1 -
A
solution\2000-2099\2043.Simple Bank System\Solution.cpp
10 1 -