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\2500-2599\2553.Separate the Digits in an Array\Solution.c
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\2500-2599\2594.Minimum Time to Repair Cars\Solution.ts
4 1 -
A
solution\2500-2599\2594.Minimum Time to Repair Cars\Solution.java
4 1 -
A
solution\2500-2599\2561.Rearranging Fruits\Solution.cpp
6 1 -
A
solution\2500-2599\2542.Maximum Subsequence Score\Solution.go
 1 -
A
solution\2500-2599\2540.Minimum Common Value\Solution.go
 1 -
A
solution\2500-2599\2538.Difference Between Maximum and Minimum Price Sum\Solution.cpp
4 1 -
A
solution\2500-2599\2535.Difference Between Element Sum and Digit Sum of an Array\Solution.cpp
3 1 -
A
solution\2500-2599\2533.Number of Good Binary Strings\Solution.cpp
5 1 -
A
solution\2500-2599\2515.Shortest Distance to Target String in a Circular Array\Solution.go
 1 -
A
solution\0300-0399\0349.Intersection of Two Arrays\Solution.cpp
5 1 -
A
solution\0400-0499\0498.Diagonal Traverse\Solution.go
 1 -
A
solution\2000-2099\2021.Brightest Position on Street\Solution.js
 1 -