main
100-Days-of-Code
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
1342-number-of-steps-to-reduce-a-number-to-zero\1342-number-of-steps-to-reduce-a-number-to-zero.cpp
4 1 1
A
1260-shift-2d-grid\1260-shift-2d-grid.cpp
8 1 4
A
1-two-sum\1-two-sum.cpp
4 1 2
A
1338-reduce-array-size-to-the-half\1338-reduce-array-size-to-the-half.cpp
6 1 4
A
11-container-with-most-water\11-container-with-most-water.cpp
5 1 1
A
117-populating-next-right-pointers-in-each-node-ii\117-populating-next-right-pointers-in-each-node-ii.cpp
7 1 6
A
1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree\1379-find-a-corresponding-node-of-a-binary-tree-in-a-clone-of-that-tree.cpp
6 1 3
A
1584-min-cost-to-connect-all-points\1584-min-cost-to-connect-all-points.cpp
10 1 5
A
1209-remove-all-adjacent-duplicates-in-string-ii\1209-remove-all-adjacent-duplicates-in-string-ii.cpp
9 1 -
A
14-longest-common-prefix\14-longest-common-prefix.cpp
5 1 2
A
1337-the-k-weakest-rows-in-a-matrix\1337-the-k-weakest-rows-in-a-matrix.cpp
5 1 4
B
13-roman-to-integer\13-roman-to-integer.cpp
13 1 7
A
105-construct-binary-tree-from-preorder-and-inorder-traversal\105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp
4 1 5
A
1339-maximum-product-of-splitted-binary-tree\1339-maximum-product-of-splitted-binary-tree.cpp
5 1 2
A
1480-running-sum-of-1d-array\1480-running-sum-of-1d-array.cpp
2 1 2
A
1647-minimum-deletions-to-make-character-frequencies-unique\1647-minimum-deletions-to-make-character-frequencies-unique.cpp
7 1 6
A
160-intersection-of-two-linked-lists\160-intersection-of-two-linked-lists.cpp
4 1 4
A
1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts\1465-maximum-area-of-a-piece-of-cake-after-horizontal-and-vertical-cuts.cpp
3 1 4
A
1025-divisor-game\1025-divisor-game.cpp
3 1 1
A
1302-deepest-leaves-sum\1302-deepest-leaves-sum.cpp
7 1 1