main
leetcode-elixir
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2442.Count Number of Distinct Integers After Reverse Operations\Solution.java
4 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.cpp
4 1 -
A
solution\0800-0899\0862.Shortest Subarray with Sum at Least K\Solution.cpp
8 1 -
A
solution\2400-2499\2443.Sum of Number and Its Reverse\Solution.java
4 1 -
A
solution\2400-2499\2444.Count Subarrays With Fixed Bounds\Solution.cpp
6 1 -
A
solution\0800-0899\0862.Shortest Subarray with Sum at Least K\Solution.java
8 1 -
A
solution\0300-0399\0317.Shortest Distance from All Buildings\Solution.go
 1 -
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.java
5 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.java
7 1 -
A
solution\2000-2099\2034.Stock Price Fluctuation\Solution.cpp
7 1 -
A
solution\0400-0499\0484.Find Permutation\Solution.cpp
4 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.js
3 1 -
A
solution\2000-2099\2034.Stock Price Fluctuation\Solution.go
 1 -
A
solution\2000-2099\2034.Stock Price Fluctuation\Solution.py
8 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 -