main
leetcode-rockstar
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2036.Maximum Alternating Subarray Sum\Solution.java
2 1 -
A
solution\2300-2399\2369.Check if There is a Valid Partition For The Array\Solution.go
 1 -
A
solution\2300-2399\2369.Check if There is a Valid Partition For The Array\Solution.py
1 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.cpp
4 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.cpp
5 1 -
A
solution\0800-0899\0851.Loud and Rich\Solution.go
 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.java
5 1 -
A
solution\0300-0399\0375.Guess Number Higher or Lower II\Solution.java
4 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.ts
3 1 -
A
solution\0800-0899\0851.Loud and Rich\Solution.py
3 1 -
A
solution\2300-2399\2371.Minimize Maximum Value in a Grid\Solution.go
 1 -
A
solution\0500-0599\0589.N-ary Tree Preorder Traversal\Solution.java
4 1 -
A
solution\2000-2099\2037.Minimum Number of Moves to Seat Everyone\Solution.go
 1 -
A
solution\0600-0699\0697.Degree of an Array\Solution.go
 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.cpp
7 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.go
 1 -
A
solution\0400-0499\0497.Random Point in Non-overlapping Rectangles\Solution.java
5 1 -
A
solution\0600-0699\0697.Degree of an Array\Solution.java
6 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.java
6 1 -
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.cpp
6 1 -