main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2400-2499\2465.Number of Distinct Averages\Solution.cpp
2 1 -
A
solution\2400-2499\2464.Minimum Subarrays in a Valid Split\Solution.py
2 1 -
A
solution\2400-2499\2464.Minimum Subarrays in a Valid Split\Solution.java
9 1 -
A
solution\2400-2499\2464.Minimum Subarrays in a Valid Split\Solution.go
 1 -
A
solution\2400-2499\2464.Minimum Subarrays in a Valid Split\Solution.cpp
6 1 -
A
solution\2400-2499\2463.Minimum Total Distance Traveled\Solution.py
1 1 -
A
solution\2400-2499\2463.Minimum Total Distance Traveled\Solution.java
7 1 -
A
solution\2400-2499\2463.Minimum Total Distance Traveled\Solution.go
 1 -
A
solution\2400-2499\2463.Minimum Total Distance Traveled\Solution.cpp
6 1 -
A
solution\2400-2499\2462.Total Cost to Hire K Workers\Solution.py
9 1 -
A
solution\2400-2499\2462.Total Cost to Hire K Workers\Solution.java
10 1 -
A
solution\2400-2499\2462.Total Cost to Hire K Workers\Solution.go
 1 -
A
solution\2400-2499\2462.Total Cost to Hire K Workers\Solution.cpp
9 1 -
A
solution\2400-2499\2461.Maximum Sum of Distinct Subarrays With Length K\Solution.py
5 1 -
A
solution\2400-2499\2461.Maximum Sum of Distinct Subarrays With Length K\Solution.java
6 1 -
A
solution\2400-2499\2461.Maximum Sum of Distinct Subarrays With Length K\Solution.go
 1 -
A
solution\2400-2499\2461.Maximum Sum of Distinct Subarrays With Length K\Solution.cpp
6 1 -
A
solution\2400-2499\2460.Apply Operations to an Array\Solution.py
5 1 -
A
solution\2400-2499\2460.Apply Operations to an Array\Solution.java
7 1 -
A
solution\2400-2499\2460.Apply Operations to an Array\Solution.go
 1 -