main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2049.Count Nodes With the Highest Score\Solution.java
8 1 -
A
solution\2000-2099\2032.Two Out of Three\Solution.cpp
4 1 -
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.go
 1 -
A
solution\2000-2099\2032.Two Out of Three\Solution.java
5 1 -
A
solution\0300-0399\0309.Best Time to Buy and Sell Stock with Cooldown\Solution.go
 1 -
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.cpp
5 1 -
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.py
2 1 -
A
solution\2000-2099\2033.Minimum Operations to Make a Uni-Value Grid\Solution.java
5 1 -
A
solution\2000-2099\2038.Remove Colored Pieces if Both Neighbors are the Same Color\Solution.java
6 1 -
A
solution\2100-2199\2120.Execution of All Suffix Instructions Staying in a Grid\Solution.ts
8 1 -
A
solution\2100-2199\2120.Execution of All Suffix Instructions Staying in a Grid\Solution.py
5 1 -
A
solution\2000-2099\2093.Minimum Cost to Reach City With Discounts\Solution.cpp
7 1 -
A
solution\2000-2099\2073.Time Needed to Buy Tickets\Solution.go
 1 -
A
solution\2000-2099\2064.Minimized Maximum of Products Distributed to Any Store\Solution.java
4 1 -
A
solution\2000-2099\2054.Two Best Non-Overlapping Events\Solution.cpp
7 1 -
A
solution\2000-2099\2049.Count Nodes With the Highest Score\Solution.py
3 1 -
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.java
7 1 -
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.go
 1 -
A
solution\2000-2099\2042.Check if Numbers Are Ascending in a Sentence\Solution.c
8 1 -
A
solution\2000-2099\2035.Partition Array Into Two Arrays to Minimize Sum Difference\Solution.java
9 1 -