main
leetcode-tcsh
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0300-0399\0364.Nested List Weight Sum II\Solution.java
7 1 -
A
solution\2400-2499\2467.Most Profitable Path in a Tree\Solution.cpp
12 1 -
A
solution\0800-0899\0882.Reachable Nodes In Subdivided Graph\Solution.py
7 1 -
A
solution\2400-2499\2467.Most Profitable Path in a Tree\Solution.java
14 1 -
A
solution\0500-0599\0599.Minimum Index Sum of Two Lists\Solution.java
6 1 -
A
solution\2400-2499\2468.Split Message Based on Limit\Solution.cpp
4 1 -
A
solution\0800-0899\0883.Projection Area of 3D Shapes\Solution.go
 1 -
A
solution\2400-2499\2468.Split Message Based on Limit\Solution.java
4 1 -
A
solution\0400-0499\0437.Path Sum III\Solution.java
3 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.py
9 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.c
5 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\0400-0499\0483.Smallest Good Base\Solution.cpp
4 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.cpp
5 1 -
A
solution\2000-2099\2037.Minimum Number of Moves to Seat Everyone\Solution.go
 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.cpp
7 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.go
 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.java
6 1 -