main
leetcode-chez
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2200-2299\2259.Remove Digit From Number to Maximize Result\Solution.java
5 1 -
A
solution\0800-0899\0804.Unique Morse Code Words\Solution.java
3 1 -
A
solution\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.cpp
0 1 -
A
solution\0500-0599\0558.Logical OR of Two Binary Grids Represented as Quad-Trees\Solution.cpp
10 1 -
A
solution\2200-2299\2260.Minimum Consecutive Cards to Pick Up\Solution.java
4 1 -
A
solution\0800-0899\0804.Unique Morse Code Words\Solution.ts
 1 -
A
solution\2200-2299\2261.K Divisible Elements Subarrays\Solution.go
 1 -
A
solution\0400-0499\0427.Construct Quad Tree\Solution.java
7 1 -
A
solution\2300-2399\2343.Query Kth Smallest Trimmed Number\Solution.go
 1 -
A
solution\2300-2399\2343.Query Kth Smallest Trimmed Number\Solution.cpp
3 1 -
A
solution\2300-2399\2309.Greatest English Letter in Upper and Lower Case\Solution.go
 1 -
A
solution\2200-2299\2294.Partition Array Such That Maximum Difference Is K\Solution.java
3 1 -
A
solution\2200-2299\2290.Minimum Obstacle Removal to Reach Corner\Solution.py
9 1 -
A
solution\2200-2299\2287.Rearrange Characters to Make Target String\Solution.ts
4 1 -
A
solution\2200-2299\2284.Sender With Largest Word Count\Solution.java
8 1 -
A
solution\2200-2299\2283.Check if Number Has Equal Digit Count and Digit Value\Solution.cpp
0 1 -
A
solution\2200-2299\2263.Make Array Non-decreasing or Non-increasing\Solution.java
7 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 -