# Status Problem video Level Completes Likes 146 Dynamic Programming - Stairs Climbing Puzzle Beginner % 1 145 Dynamic Programming - Minimum Coin Change Problem Medium % 1 143 Merge K Sorted Arrays Hard % 0 137 Populate Next Right Pointers in Each Node Hard % 0 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 125 Find the Increasing Triplet Sub-sequence in an array Medium % 0 121 Print All the Subsets of a Given Set (Power Set) Hard % 1 116 Generate All Balanced Parentheses Combinations (N Pairs) Medium % 1 112 Generate All n-Bit Binary Strings Medium % 1 108 Queue with Stacks: Efficient Implementation Using Stack Operations Medium % 0 106 Reverse a Doubly-Linked List (In-place Algorithm) Medium % 0 102 Merge Sort for Linked Lists (In-place Algorithm) Medium % 0 101 Merge a Linked list into another Linked List at Alternate Positions Medium % 0 99 Construct a binary tree from given Inorder and Level Order Traversal Hard % 0 96 Print The Top View of a Binary Tree Medium % 0 93 Inorder Predecessor and Successor in Binary Search Tree Hard % 0 88 Rearrange Array: Positive and Negative Elements Alternating Hard % 0 86 Find Kth Smallest or Largest element in an Array Medium % 0 Dynamic Programming - Stairs Climbing Puzzle Dynamic Programming - Minimum Coin Change Problem Merge K Sorted Arrays Populate Next Right Pointers in Each Node Find Paths with Sum in Binary Tree Diameter Of a Binary Tree Find the Deepest Node in a Binary Tree Find the Increasing Triplet Sub-sequence in an array Print All the Subsets of a Given Set (Power Set) Generate All Balanced Parentheses Combinations (N Pairs) Generate All n-Bit Binary Strings Queue with Stacks: Efficient Implementation Using Stack Operations Reverse a Doubly-Linked List (In-place Algorithm) Merge Sort for Linked Lists (In-place Algorithm) Merge a Linked list into another Linked List at Alternate Positions Construct a binary tree from given Inorder and Level Order Traversal Print The Top View of a Binary Tree Inorder Predecessor and Successor in Binary Search Tree Rearrange Array: Positive and Negative Elements Alternating Find Kth Smallest or Largest element in an Array 1 2 3 4 5 6 7 8
