main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\1000-1099\1011.Capacity To Ship Packages Within D Days\Solution.go
 1 -
A
solution\1000-1099\1011.Capacity To Ship Packages Within D Days\Solution.cpp
7 1 -
A
solution\1000-1099\1010.Pairs of Songs With Total Durations Divisible by 60\Solution.py
3 1 -
A
solution\1000-1099\1010.Pairs of Songs With Total Durations Divisible by 60\Solution.java
5 1 -
A
solution\1000-1099\1010.Pairs of Songs With Total Durations Divisible by 60\Solution.go
 1 -
A
solution\1000-1099\1010.Pairs of Songs With Total Durations Divisible by 60\Solution.cpp
5 1 -
A
solution\1000-1099\1009.Complement of Base 10 Integer\Solution.py
6 1 -
A
solution\1000-1099\1009.Complement of Base 10 Integer\Solution.java
6 1 -
A
solution\1000-1099\1009.Complement of Base 10 Integer\Solution.go
 1 -
A
solution\1000-1099\1009.Complement of Base 10 Integer\Solution.cpp
6 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.ts
7 1 1
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.py
1 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.java
6 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.go
 1 -
A
solution\1000-1099\1008.Construct Binary Search Tree from Preorder Traversal\Solution.cpp
7 1 -
A
solution\1000-1099\1007.Minimum Domino Rotations For Equal Row\Solution.py
20 1 1
A
solution\1000-1099\1006.Clumsy Factorial\Solution.py
5 1 -
A
solution\1000-1099\1006.Clumsy Factorial\Solution.java
6 1 -
A
solution\1000-1099\1005.Maximize Sum Of Array After K Negations\Solution.ts
17 1 2
A
solution\1000-1099\1005.Maximize Sum Of Array After K Negations\Solution.py
9 1 -