main
leetcode-umka
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0600-0699\0630.Course Schedule III\Solution.java
3 1 -
A
solution\0600-0699\0630.Course Schedule III\Solution.py
3 1 -
A
solution\0900-0999\0933.Number of Recent Calls\Solution.js
3 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.py
3 1 -
A
solution\2200-2299\2215.Find the Difference of Two Arrays\Solution.ts
3 1 1
A
solution\0400-0499\0413.Arithmetic Slices\Solution.java
3 1 -
A
solution\2200-2299\2217.Find Palindrome With Fixed Length\Solution.java
3 1 -
A
solution\2200-2299\2215.Find the Difference of Two Arrays\Solution.js
3 1 1
A
solution\0900-0999\0918.Maximum Sum Circular Subarray\Solution.java
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.java
3 1 -
A
solution\0500-0599\0508.Most Frequent Subtree Sum\Solution.py
3 1 -
A
solution\2000-2099\2090.K Radius Subarray Averages\Solution.cpp
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.py
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.cpp
3 1 -
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.cpp
3 1 -
A
solution\2000-2099\2089.Find Target Indices After Sorting Array\Solution.py
3 1 -
A
solution\2000-2099\2089.Find Target Indices After Sorting Array\Solution.java
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.ts
3 1 1
A
solution\2300-2399\2365.Task Scheduler II\Solution.ts
3 1 1
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.java
3 1 -