main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2042.Check if Numbers Are Ascending in a Sentence\Solution.cpp
4 1 -
A
solution\2000-2099\2042.Check if Numbers Are Ascending in a Sentence\Solution.c
8 1 -
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.py
6 1 -
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.java
6 1 -
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.go
 1 -
A
solution\2000-2099\2039.The Time When the Network Becomes Idle\Solution.cpp
6 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.py
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\2038.Remove Colored Pieces if Both Neighbors are the Same Color\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\2037.Minimum Number of Moves to Seat Everyone\Solution.ts
4 1 1
A
solution\2000-2099\2037.Minimum Number of Moves to Seat Everyone\Solution.java
2 1 -
A
solution\2000-2099\2037.Minimum Number of Moves to Seat Everyone\Solution.go
 1 -
A
solution\2000-2099\2037.Minimum Number of Moves to Seat Everyone\Solution.cpp
2 1 -
A
solution\2000-2099\2037.Minimum Number of Moves to Seat Everyone\Solution.c
3 1 -
A
solution\2000-2099\2036.Maximum Alternating Subarray Sum\Solution.java
2 1 -
A
solution\2000-2099\2036.Maximum Alternating Subarray Sum\Solution.go
 1 -
A
solution\2000-2099\2036.Maximum Alternating Subarray Sum\Solution.cpp
2 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.py
9 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.java
9 1 -