main
leetcode-scheme
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2500-2599\2571.Minimum Operations to Reduce an Integer to 0\Solution.java
7 1 -
A
solution\2500-2599\2571.Minimum Operations to Reduce an Integer to 0\Solution.go
 1 -
A
solution\2500-2599\2571.Minimum Operations to Reduce an Integer to 0\Solution.cpp
7 1 -
A
solution\2500-2599\2570.Merge Two 2D Arrays by Summing Values\Solution.ts
5 1 -
A
solution\2500-2599\2570.Merge Two 2D Arrays by Summing Values\Solution.java
7 1 -
A
solution\2500-2599\2570.Merge Two 2D Arrays by Summing Values\Solution.go
 1 -
A
solution\2500-2599\2570.Merge Two 2D Arrays by Summing Values\Solution.cpp
5 1 -
A
solution\2500-2599\2569.Handling Sum Queries After Update\Solution.py
22 1 4
A
solution\2500-2599\2569.Handling Sum Queries After Update\Solution.java
24 1 3
A
solution\2500-2599\2569.Handling Sum Queries After Update\Solution.go
 1 -
A
solution\2500-2599\2569.Handling Sum Queries After Update\Solution.cpp
23 1 -
A
solution\2500-2599\2566.Maximum Difference by Remapping a Digit\Solution.go
 1 -
A
solution\2500-2599\2566.Maximum Difference by Remapping a Digit\Solution.cpp
7 1 -
A
solution\2500-2599\2566.Maximum Difference by Remapping a Digit\Solution.c
10 1 -
A
solution\2500-2599\2565.Subsequence With the Minimum Score\Solution.py
7 1 1
A
solution\2500-2599\2565.Subsequence With the Minimum Score\Solution.java
15 1 -
A
solution\2500-2599\2565.Subsequence With the Minimum Score\Solution.go
 1 -
A
solution\2500-2599\2565.Subsequence With the Minimum Score\Solution.cpp
14 1 -
A
solution\2500-2599\2564.Substring XOR Queries\Solution.py
7 1 -
A
solution\2500-2599\2564.Substring XOR Queries\Solution.java
6 1 -