main
leetcode-lol-code
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0900-0999\0961.N-Repeated Element in Size 2N Array\Solution.py
3 1 -
A
solution\0900-0999\0961.N-Repeated Element in Size 2N Array\Solution.java
3 1 -
A
solution\2300-2399\2383.Minimum Hours of Training to Win a Competition\Solution.ts
3 1 -
A
solution\2200-2299\2229.Check if an Array Is Consecutive\Solution.java
3 1 -
A
solution\0300-0399\0347.Top K Frequent Elements\Solution.ts
3 1 -
A
solution\0900-0999\0991.Broken Calculator\Solution.java
3 1 -
A
solution\0900-0999\0991.Broken Calculator\Solution.py
3 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.cpp
3 1 -
A
solution\2300-2399\2374.Node With Highest Edge Score\Solution.ts
3 1 -
A
solution\2000-2099\2057.Smallest Index With Equal Value\Solution.java
3 1 -
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.java
3 1 -
A
solution\0800-0899\0851.Loud and Rich\Solution.py
3 1 -
A
solution\2300-2399\2379.Minimum Recolors to Get K Consecutive Black Blocks\Solution.c
3 1 -
A
solution\2200-2299\2233.Maximum Product After K Increments\Solution.cpp
3 1 -
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.java
3 1 -
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.js
3 1 -
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.py
3 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.ts
3 1 -
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.ts
3 1 -
A
solution\2300-2399\2371.Minimize Maximum Value in a Grid\Solution.ts
3 1 -