main
leetcode-elvish
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2459.Sort Array by Moving Items to Empty Space\Solution.java
8 1 -
A
solution\0800-0899\0882.Reachable Nodes In Subdivided Graph\Solution.go
 1 -
A
solution\2400-2499\2460.Apply Operations to an Array\Solution.cpp
7 1 -
A
solution\2500-2599\2509.Cycle Length Queries in a Tree\Solution.py
4 1 -
A
solution\2400-2499\2460.Apply Operations to an Array\Solution.java
7 1 -
A
solution\0800-0899\0882.Reachable Nodes In Subdivided Graph\Solution.py
7 1 -
A
solution\2400-2499\2461.Maximum Sum of Distinct Subarrays With Length K\Solution.go
 1 -
A
solution\2500-2599\2510.Check if There is a Path With Equal Number of 0's And 1's\Solution.cpp
9 1 -
A
solution\2500-2599\2547.Minimum Cost to Split an Array\Solution.java
7 1 -
A
solution\2500-2599\2547.Minimum Cost to Split an Array\Solution.go
 1 -
A
solution\2500-2599\2511.Maximum Enemy Forts That Can Be Captured\Solution.py
7 1 -
A
solution\2400-2499\2498.Frog Jump II\Solution.go
 1 -
A
solution\2400-2499\2492.Minimum Score of a Path Between Two Cities\Solution.py
2 1 -
A
solution\2400-2499\2487.Remove Nodes From Linked List\Solution.java
6 1 -
A
solution\2400-2499\2482.Difference Between Ones and Zeros in Row and Column\Solution.ts
5 1 -
A
solution\2400-2499\2471.Minimum Number of Operations to Sort a Binary Tree by Level\Solution.ts
8 1 -
A
solution\2400-2499\2463.Minimum Total Distance Traveled\Solution.py
1 1 -
A
solution\0300-0399\0399.Evaluate Division\Solution.cpp
8 1 -
A
solution\0700-0799\0702.Search in a Sorted Array of Unknown Size\Solution.cpp
5 1 -
A
solution\2000-2099\2036.Maximum Alternating Subarray Sum\Solution.cpp
2 1 -