main
leetcode-chez
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2500-2599\2511.Maximum Enemy Forts That Can Be Captured\Solution.py
7 1 -
A
solution\0900-0999\0921.Minimum Add to Make Parentheses Valid\Solution.cpp
0 1 -
A
solution\2500-2599\2512.Reward Top K Students\Solution.cpp
0 1 -
A
solution\1000-1099\1017.Convert to Base -2\Solution.cpp
5 1 -
A
solution\2500-2599\2512.Reward Top K Students\Solution.java
9 1 -
A
solution\0900-0999\0921.Minimum Add to Make Parentheses Valid\Solution.java
4 1 -
A
solution\2500-2599\2512.Reward Top K Students\Solution.ts
4 1 -
A
solution\0600-0699\0653.Two Sum IV - Input is a BST\Solution.go
 1 -
A
solution\0400-0499\0496.Next Greater Element I\Solution.java
5 1 -
A
solution\0600-0699\0697.Degree of an Array\Solution.go
 1 -
A
solution\1000-1099\1017.Convert to Base -2\Solution.go
 1 -
A
solution\1000-1099\1017.Convert to Base -2\Solution.java
4 1 -
A
solution\0300-0399\0348.Design Tic-Tac-Toe\Solution.py
9 1 -
A
solution\0600-0699\0697.Degree of an Array\Solution.java
6 1 -
A
solution\1000-1099\1017.Convert to Base -2\Solution.py
4 1 -
A
solution\0600-0699\0697.Degree of an Array\Solution.py
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.cpp
6 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.go
 1 -
A
solution\0600-0699\0698.Partition to K Equal Sum Subsets\Solution.cpp
0 1 -
A
solution\1000-1099\1019.Next Greater Node In Linked List\Solution.java
6 1 -