main
leetcode-modula
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0500-0599\0556.Next Greater Element III\Solution.go
 1 -
A
solution\2200-2299\2280.Minimum Lines to Represent a Line Chart\Solution.java
3 1 -
A
solution\0800-0899\0806.Number of Lines To Write String\Solution.java
3 1 -
A
solution\0400-0499\0429.N-ary Tree Level Order Traversal\Solution.py
4 1 -
A
solution\2200-2299\2281.Sum of Total Strength of Wizards\Solution.java
12 1 -
A
solution\0800-0899\0807.Max Increase to Keep City Skyline\Solution.go
 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.c
5 1 -
A
solution\0500-0599\0556.Next Greater Element III\Solution.py
6 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.go
 1 -
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.go
 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\0698.Partition to K Equal Sum Subsets\Solution.java
10 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 -
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.py
2 1 -
A
solution\2000-2099\2037.Minimum Number of Moves to Seat Everyone\Solution.go
 1 -
A
solution\0300-0399\0324.Wiggle Sort II\Solution.java
3 1 -
A
solution\0300-0399\0354.Russian Doll Envelopes\Solution.java
7 1 -
A
solution\0400-0499\0402.Remove K Digits\Solution.java
9 1 -