main
leetcode-tcsh
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0870.Advantage Shuffle\Solution.ts
3 1 -
A
solution\0500-0599\0591.Tag Validator\Solution.cpp
19 1 -
A
solution\2400-2499\2449.Minimum Number of Operations to Make Arrays Similar\Solution.go
 1 -
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.go
 1 -
A
solution\2400-2499\2451.Odd String Difference\Solution.cpp
5 1 -
A
solution\0400-0499\0433.Minimum Genetic Mutation\Solution.py
6 1 -
A
solution\2400-2499\2451.Odd String Difference\Solution.java
5 1 -
A
solution\0800-0899\0871.Minimum Number of Refueling Stops\Solution.py
5 1 -
A
solution\2400-2499\2452.Words Within Two Edits of Dictionary\Solution.cpp
5 1 -
A
solution\0500-0599\0591.Tag Validator\Solution.java
19 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 -