main
leetcode-lol-code
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.cpp
7 1 -
A
solution\2500-2599\2570.Merge Two 2D Arrays by Summing Values\Solution.ts
4 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\2568.Minimum Impossible OR\Solution.ts
3 1 -
A
solution\2500-2599\2568.Minimum Impossible OR\Solution.py
3 1 -
A
solution\2500-2599\2568.Minimum Impossible OR\Solution.java
4 1 -
A
solution\2500-2599\2568.Minimum Impossible OR\Solution.go
 1 -
A
solution\2500-2599\2568.Minimum Impossible OR\Solution.cpp
3 1 -
A
solution\2500-2599\2567.Minimum Score by Changing Two Elements\Solution.py
1 1 -
A
solution\2500-2599\2567.Minimum Score by Changing Two Elements\Solution.java
1 1 -
A
solution\2500-2599\2567.Minimum Score by Changing Two Elements\Solution.go
 1 -
A
solution\2500-2599\2566.Maximum Difference by Remapping a Digit\Solution.ts
2 1 -
A
solution\2500-2599\2566.Maximum Difference by Remapping a Digit\Solution.java
3 1 -
A
solution\2500-2599\2566.Maximum Difference by Remapping a Digit\Solution.go
 1 -