main
leetcode-scheme
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2500-2599\2529.Maximum Count of Positive Integer and Negative Integer\Solution.ts
3 1 -
A
solution\0800-0899\0898.Bitwise ORs of Subarrays\Solution.go
 1 -
A
solution\2500-2599\2530.Maximal Score After Applying K Operations\Solution.go
 1 -
A
solution\0300-0399\0314.Binary Tree Vertical Order Traversal\Solution.py
7 1 -
A
solution\2500-2599\2531.Make Number of Distinct Characters Equal\Solution.cpp
11 1 -
A
solution\0800-0899\0898.Bitwise ORs of Subarrays\Solution.py
4 1 -
A
solution\2500-2599\2531.Make Number of Distinct Characters Equal\Solution.java
11 1 -
A
solution\2500-2599\2564.Substring XOR Queries\Solution.go
 1 -
A
solution\2600-2699\2610.Convert an Array Into a 2D Array With Conditions\Solution.ts
4 1 -
A
solution\2600-2699\2610.Convert an Array Into a 2D Array With Conditions\Solution.py
4 1 -
A
solution\2500-2599\2578.Split With Minimum Sum\Solution.cpp
4 1 -
A
solution\2500-2599\2566.Maximum Difference by Remapping a Digit\Solution.go
 1 -
A
solution\2500-2599\2557.Maximum Number of Integers to Choose From a Range II\Solution.go
 1 -
A
solution\2500-2599\2554.Maximum Number of Integers to Choose From a Range I\Solution.go
 1 -
A
solution\2500-2599\2533.Number of Good Binary Strings\Solution.py
4 1 -
A
solution\0300-0399\0340.Longest Substring with At Most K Distinct Characters\Solution.java
4 1 -
A
solution\0300-0399\0383.Ransom Note\Solution.cpp
4 1 -
A
solution\0400-0499\0463.Island Perimeter\Solution.ts
10 1 -
A
solution\0600-0699\0654.Maximum Binary Tree\Solution.cpp
5 1 -
A
solution\0900-0999\0962.Maximum Width Ramp\Solution.java
8 1 -