main
100-Days-of-Code
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
B
Day4.cpp
21 1 7
B
Root to leaf path sum - GFG\root-to-leaf-path-sum.cpp
19 1 5
B
73-set-matrix-zeroes\73-set-matrix-zeroes.cpp
18 1 8
B
Preorder Traversal - GFG\preorder-traversal.cpp
18 1 4
B
Topological sort - GFG\topological-sort.cpp
18 2 4
B
Bipartite Graph - GFG\bipartite-graph.cpp
17 1 8
A
Rat in a Maze Problem - I - GFG\rat-in-a-maze-problem-i.cpp
16 1 3
A
Detect cycle in an undirected graph - GFG\detect-cycle-in-an-undirected-graph.cpp
15 1 2
A
17-letter-combinations-of-a-phone-number\17-letter-combinations-of-a-phone-number.cpp
14 1 4
B
Add 1 to a number represented as linked list - GFG\add-1-to-a-number-represented-as-linked-list.cpp
14 1 5
A
844-backspace-string-compare\844-backspace-string-compare.cpp
14 1 2
A
1091-shortest-path-in-binary-matrix\1091-shortest-path-in-binary-matrix.cpp
14 2 4
A
785-is-graph-bipartite\785-is-graph-bipartite.cpp
13 1 6
A
680-valid-palindrome-ii\680-valid-palindrome-ii.cpp
13 1 3
A
0 - 1 Knapsack Problem - GFG\0-1-knapsack-problem.cpp
13 3 2
A
34-find-first-and-last-position-of-element-in-sorted-array\34-find-first-and-last-position-of-element-in-sorted-array.cpp
13 1 4
B
13-roman-to-integer\13-roman-to-integer.cpp
13 1 7
A
Day1.cpp
12 1 5
A
Perfect Sum Problem - GFG\perfect-sum-problem.cpp
12 1 6
A
97-interleaving-string\97-interleaving-string.cpp
11 1 5