# Status Problem video Level Completes Likes 147 Introduction To Backtracking Programming Beginner % 0 146 Dynamic Programming - Stairs Climbing Puzzle Beginner % 1 145 Dynamic Programming - Minimum Coin Change Problem Medium % 1 144 Introduction To Dynamic Programming - Fibonacci Series Beginner % 1 142 Locate the Farthest Left Node on the Bottom Level Medium % 0 138 Find the Maximum Value in a Binary Tree Beginner % 0 137 Populate Next Right Pointers in Each Node Hard % 0 136 Verifying Mirror Binary Trees Beginner % 1 135 Find Paths with Sum in Binary Tree Medium % 0 134 Diameter Of a Binary Tree Hard % 1 132 Find the Deepest Node in a Binary Tree Medium % 1 131 Find the Height of a tree without using Recursion Medium % 0 130 Find and Print Full Nodes in a Binary Tree Beginner % 0 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 109 Find Greatest Common Divisor (GCD) Efficiently with Euclidean Algorithm Beginner % 0 104 Print the Bottom View of a Binary Tree Medium % 0 102 Merge Sort for Linked Lists (In-place Algorithm) Medium % 0 100 AVL Tree - Insertion Hard % 0 Introduction To Backtracking Programming Dynamic Programming - Stairs Climbing Puzzle Dynamic Programming - Minimum Coin Change Problem Introduction To Dynamic Programming - Fibonacci Series Locate the Farthest Left Node on the Bottom Level Find the Maximum Value in a Binary Tree Populate Next Right Pointers in Each Node Verifying Mirror Binary Trees Find Paths with Sum in Binary Tree Diameter Of a Binary Tree Find the Deepest Node in a Binary Tree Find the Height of a tree without using Recursion Find and Print Full Nodes in a Binary Tree Generate All Balanced Parentheses Combinations (N Pairs) Towers Of Hanoi Generate All n-Bit Binary Strings Find Greatest Common Divisor (GCD) Efficiently with Euclidean Algorithm Print the Bottom View of a Binary Tree Merge Sort for Linked Lists (In-place Algorithm) AVL Tree - Insertion 1 2 3 4 5 6 7 8
