main
leetcode-elixir
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0320.Generalized Abbreviation\Solution.java
5 1 -
A
solution\2500-2599\2505.Bitwise OR of All Subsequence Sums\Solution.cpp
6 1 -
A
solution\0800-0899\0897.Increasing Order Search Tree\Solution.go
 1 -
A
solution\2000-2099\2034.Stock Price Fluctuation\Solution.py
8 1 -
A
solution\2500-2599\2506.Count Pairs Of Similar Strings\Solution.cpp
3 1 -
A
solution\0800-0899\0897.Increasing Order Search Tree\Solution.py
1 1 -
A
solution\2500-2599\2507.Smallest Value After Replacing With Sum of Prime Factors\Solution.cpp
6 1 -
A
solution\0400-0499\0440.K-th Smallest in Lexicographical Order\Solution.py
3 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.ts
3 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.cpp
12 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.go
 1 -
A
solution\0300-0399\0333.Largest BST Subtree\Solution.go
 1 -
A
solution\0300-0399\0386.Lexicographical Numbers\Solution.cpp
6 1 -
A
solution\0400-0499\0484.Find Permutation\Solution.go
 1 -
A
solution\0600-0699\0688.Knight Probability in Chessboard\Solution.cpp
11 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.java
9 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.py
9 1 -
A
solution\0600-0699\0688.Knight Probability in Chessboard\Solution.go
 1 -
A
solution\2000-2099\2036.Maximum Alternating Subarray Sum\Solution.cpp
2 1 -
A
solution\2000-2099\2036.Maximum Alternating Subarray Sum\Solution.go
 1 -