main
leetcode-scheme
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.py
3 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.cpp
3 1 -
A
solution\2000-2099\2079.Watering Plants\Solution.ts
3 1 -
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.cpp
3 1 -
A
solution\0700-0799\0752.Open the Lock\Solution.py
3 1 -
A
solution\2300-2399\2374.Node With Highest Edge Score\Solution.ts
3 1 -
A
solution\2300-2399\2371.Minimize Maximum Value in a Grid\Solution.ts
3 1 -
A
solution\2000-2099\2071.Maximum Number of Tasks You Can Assign\Solution.py
3 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.ts
3 1 -
A
solution\2000-2099\2049.Count Nodes With the Highest Score\Solution.py
3 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.java
3 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.js
3 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.py
3 1 -
A
solution\0600-0699\0684.Redundant Connection\Solution.js
3 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.ts
3 1 -
A
solution\0600-0699\0686.Repeated String Match\Solution.java
3 1 -
A
solution\0700-0799\0724.Find Pivot Index\Solution.java
3 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.js
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.cpp
3 1 -
A
solution\0600-0699\0687.Longest Univalue Path\Solution.ts
3 1 -