main
leetcode-elixir
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.cpp
5 1 -
A
solution\0600-0699\0674.Longest Continuous Increasing Subsequence\Solution.java
3 1 -
A
solution\2000-2099\2025.Maximum Number of Ways to Partition an Array\Solution.java
5 1 -
A
solution\0400-0499\0474.Ones and Zeroes\Solution.go
 1 -
A
solution\2000-2099\2027.Minimum Moves to Convert String\Solution.c
4 1 -
A
solution\0600-0699\0675.Cut Off Trees for Golf Event\Solution.cpp
17 1 -
A
solution\0300-0399\0380.Insert Delete GetRandom O(1)\Solution.go
 1 -
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.java
5 1 -
A
solution\0300-0399\0356.Line Reflection\Solution.py
4 1 -
A
solution\0400-0499\0423.Reconstruct Original Digits from English\Solution.go
 1 -
A
solution\0500-0599\0562.Longest Line of Consecutive One in Matrix\Solution.go
 1 -
A
solution\0800-0899\0850.Rectangle Area II\Solution.cpp
20 1 -
A
solution\0500-0599\0562.Longest Line of Consecutive One in Matrix\Solution.java
6 1 -
A
solution\0800-0899\0850.Rectangle Area II\Solution.go
 1 -
A
solution\0400-0499\0423.Reconstruct Original Digits from English\Solution.java
4 1 -
A
solution\0500-0599\0562.Longest Line of Consecutive One in Matrix\Solution.py
8 1 -
A
solution\0800-0899\0851.Loud and Rich\Solution.cpp
6 1 -
A
solution\0800-0899\0851.Loud and Rich\Solution.go
 1 -
A
solution\0500-0599\0563.Binary Tree Tilt\Solution.cpp
3 1 -
A
solution\0800-0899\0851.Loud and Rich\Solution.java
7 1 -