# Status Problem video Level Completes Likes 135 Find Paths with Sum in Binary Tree Medium % 0 134 Diameter Of a Binary Tree Hard % 1 133 Reverse Level Order Traversal of Binary Trees Medium % 0 132 Find the Deepest Node in a Binary Tree Medium % 1 130 Find and Print Full Nodes in a Binary Tree Beginner % 0 129 Binary Min-Max Heap Implementation Hard % 0 127 Numbers Palindrome in Both Decimal and Octal Beginner % 0 126 Generate All Permutations of a String (Well-Ordered) Medium % 0 124 Create a Specific Triangle Pattern from an Array Beginner % 0 123 Colorful Numbers Hard % 3 122 Goldbach's Conjecture Beginner % 0 121 Print All the Subsets of a Given Set (Power Set) Hard % 1 120 Convert Decimal to Irreducible Fraction (Simplified Form) Beginner % 0 119 Clock Angle Problem Beginner % 1 118 Print All Combinations of subset of size K from Given Array Hard % 0 117 Stack with Max Tracking: Find the Largest Element (Optimized) Medium % 1 116 Generate All Balanced Parentheses Combinations (N Pairs) Medium % 1 113 Towers Of Hanoi Beginner % 0 112 Generate All n-Bit Binary Strings Medium % 1 111 Find Unique Number in Array with Duplicates (Except One) Beginner % 1 Find Paths with Sum in Binary Tree Diameter Of a Binary Tree Reverse Level Order Traversal of Binary Trees Find the Deepest Node in a Binary Tree Find and Print Full Nodes in a Binary Tree Binary Min-Max Heap Implementation Numbers Palindrome in Both Decimal and Octal Generate All Permutations of a String (Well-Ordered) Create a Specific Triangle Pattern from an Array Colorful Numbers Goldbach's Conjecture Print All the Subsets of a Given Set (Power Set) Convert Decimal to Irreducible Fraction (Simplified Form) Clock Angle Problem Print All Combinations of subset of size K from Given Array Stack with Max Tracking: Find the Largest Element (Optimized) Generate All Balanced Parentheses Combinations (N Pairs) Towers Of Hanoi Generate All n-Bit Binary Strings Find Unique Number in Array with Duplicates (Except One) 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
