# Status Problem video Level Completes Likes 145 Dynamic Programming - Minimum Coin Change Problem Medium % 1 143 Merge K Sorted Arrays Hard % 0 141 Find the Single Occurrence Element in an Array (Odd One Out) Beginner % 1 134 Diameter Of a Binary Tree Hard % 1 128 Magic Index - Find Index In Sorted Array Such That A[i] = i Beginner % 0 127 Numbers Palindrome in Both Decimal and Octal Beginner % 0 126 Generate All Permutations of a String (Well-Ordered) Medium % 0 125 Find the Increasing Triplet Sub-sequence in an array Medium % 0 123 Colorful Numbers Hard % 3 121 Print All the Subsets of a Given Set (Power Set) Hard % 1 116 Generate All Balanced Parentheses Combinations (N Pairs) Medium % 1 108 Queue with Stacks: Efficient Implementation Using Stack Operations Medium % 0 102 Merge Sort for Linked Lists (In-place Algorithm) Medium % 0 99 Construct a binary tree from given Inorder and Level Order Traversal Hard % 0 98 Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) Hard % 0 97 Construct Binary Search Tree from a given Preorder Traversal using Recursion Hard % 0 85 Find Maximum Distance Between Increasing Elements in Array Medium % 0 84 Elements in an Array Occurring More Than N/K Times Hard % 0 82 Find Nodes at Distance X from a Given Node in a Tree Hard % 0 79 Calculate Distance Between Nodes in a Binary Tree Hard % 0 Dynamic Programming - Minimum Coin Change Problem Merge K Sorted Arrays Find the Single Occurrence Element in an Array (Odd One Out) Diameter Of a Binary Tree Magic Index - Find Index In Sorted Array Such That A[i] = i Numbers Palindrome in Both Decimal and Octal Generate All Permutations of a String (Well-Ordered) Find the Increasing Triplet Sub-sequence in an array Colorful Numbers Print All the Subsets of a Given Set (Power Set) Generate All Balanced Parentheses Combinations (N Pairs) Queue with Stacks: Efficient Implementation Using Stack Operations Merge Sort for Linked Lists (In-place Algorithm) Construct a binary tree from given Inorder and Level Order Traversal Construct Binary Search Tree from a given Preorder Traversal Using Stack (Without Recursion) Construct Binary Search Tree from a given Preorder Traversal using Recursion Find Maximum Distance Between Increasing Elements in Array Elements in an Array Occurring More Than N/K Times Find Nodes at Distance X from a Given Node in a Tree Calculate Distance Between Nodes in a Binary Tree 1 2 3 4 5 6
