main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\1000-1099\1015.Smallest Integer Divisible by K\Solution.ts
3 1 1
A
solution\1000-1099\1015.Smallest Integer Divisible by K\Solution.java
3 1 -
A
solution\1000-1099\1015.Smallest Integer Divisible by K\Solution.go
 1 -
A
solution\1000-1099\1015.Smallest Integer Divisible by K\Solution.cpp
3 1 -
A
solution\1000-1099\1014.Best Sightseeing Pair\Solution.ts
2 1 1
A
solution\1000-1099\1014.Best Sightseeing Pair\Solution.java
2 1 -
A
solution\1000-1099\1014.Best Sightseeing Pair\Solution.go
 1 -
A
solution\1000-1099\1014.Best Sightseeing Pair\Solution.cpp
2 1 -
A
solution\1000-1099\1013.Partition Array Into Three Parts With Equal Sum\Solution.py
6 1 -
A
solution\1000-1099\1013.Partition Array Into Three Parts With Equal Sum\Solution.java
7 1 -
A
solution\1000-1099\1013.Partition Array Into Three Parts With Equal Sum\Solution.go
 1 -
A
solution\1000-1099\1013.Partition Array Into Three Parts With Equal Sum\Solution.cpp
7 1 -
A
solution\1000-1099\1012.Numbers With Repeated Digits\Solution.ts
19 1 1
A
solution\1000-1099\1012.Numbers With Repeated Digits\Solution.py
3 1 -
A
solution\1000-1099\1012.Numbers With Repeated Digits\Solution.java
18 1 -
A
solution\1000-1099\1012.Numbers With Repeated Digits\Solution.go
 1 -
A
solution\1000-1099\1012.Numbers With Repeated Digits\Solution.cpp
17 1 -
A
solution\1000-1099\1011.Capacity To Ship Packages Within D Days\Solution.ts
7 1 1
A
solution\1000-1099\1011.Capacity To Ship Packages Within D Days\Solution.py
1 1 -
A
solution\1000-1099\1011.Capacity To Ship Packages Within D Days\Solution.java
7 1 -