main
100-Days-of-Code
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
C
225-implement-stack-using-queues\225-implement-stack-using-queues.cpp
11 2 11
B
Subset Sum Problem - GFG\subset-sum-problem.cpp
11 4 3
B
Topological sort - GFG\topological-sort.cpp
18 2 4
B
Preorder Traversal - GFG\preorder-traversal.cpp
18 1 4
B
743-network-delay-time\743-network-delay-time.cpp
8 1 9
B
Day4.cpp
21 1 7
B
Root to leaf path sum - GFG\root-to-leaf-path-sum.cpp
19 1 5
B
Bipartite Graph - GFG\bipartite-graph.cpp
17 1 8
B
Add 1 to a number represented as linked list - GFG\add-1-to-a-number-represented-as-linked-list.cpp
14 1 5
B
73-set-matrix-zeroes\73-set-matrix-zeroes.cpp
18 1 8
B
13-roman-to-integer\13-roman-to-integer.cpp
13 1 7
A
1143-longest-common-subsequence\1143-longest-common-subsequence.cpp
9 2 2
A
1337-the-k-weakest-rows-in-a-matrix\1337-the-k-weakest-rows-in-a-matrix.cpp
5 1 4
A
1338-reduce-array-size-to-the-half\1338-reduce-array-size-to-the-half.cpp
6 1 4
A
1339-maximum-product-of-splitted-binary-tree\1339-maximum-product-of-splitted-binary-tree.cpp
5 1 2
A
105-construct-binary-tree-from-preorder-and-inorder-traversal\105-construct-binary-tree-from-preorder-and-inorder-traversal.cpp
4 1 5
A
117-populating-next-right-pointers-in-each-node-ii\117-populating-next-right-pointers-in-each-node-ii.cpp
7 1 6
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
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
1-two-sum\1-two-sum.cpp
4 1 2