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\0300-0399\0314.Binary Tree Vertical Order Traversal\Solution.java
6 1 -
A
solution\2300-2399\2342.Max Sum of a Pair With Equal Sum of Digits\Solution.cpp
5 1 -
A
solution\0800-0899\0808.Soup Servings\Solution.java
8 1 -
A
solution\0200-0299\0294.Flip Game II\Solution.cpp
9 1 -
A
solution\0200-0299\0295.Find Median from Data Stream\Solution.cpp
5 1 -
A
solution\0200-0299\0296.Best Meeting Point\Solution.go
 1 -
A
solution\0300-0399\0300.Longest Increasing Subsequence\Solution.java
6 1 -
A
solution\0300-0399\0308.Range Sum Query 2D - Mutable\Solution.go
 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\0600-0699\0689.Maximum Sum of 3 Non-Overlapping Subarrays\Solution.py
6 1 -
A
solution\2000-2099\2043.Simple Bank System\Solution.cpp
10 1 -