# 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 141 Find the Single Occurrence Element in an Array (Odd One Out) Beginner % 1 140 Rearrange Array Elements (A[i] = i) | In-place Approach Medium % 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 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 121 Print All the Subsets of a Given Set (Power Set) Hard % 1 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 108 Queue with Stacks: Efficient Implementation Using Stack Operations Medium % 0 107 Alternate Splitting of a given Linked List Medium % 0 106 Reverse a Doubly-Linked List (In-place Algorithm) Medium % 0 105 Swapping Nodes in a Linked List (Kth Position) Medium % 0 104 Print the Bottom View of a Binary Tree Medium % 0 103 Delete X Nodes After Y Nodes In a Linked List Beginner % 0 101 Merge a Linked list into another Linked List at Alternate Positions Medium % 0 96 Print The Top View of a Binary Tree Medium % 0 93 Inorder Predecessor and Successor in Binary Search Tree Hard % 0 92 Check if Array Contains All Elements Of Some Given Range Medium % 0 91 Check if Array is Consecutive Integers Beginner % 0 90 Find Subarray with Sum Equal to a Target Value Medium % 0 88 Rearrange Array: Positive and Negative Elements Alternating Hard % 0 87 Find Intersection of Two Sorted Arrays Beginner % 0 Dynamic Programming - Stairs Climbing Puzzle Dynamic Programming - Minimum Coin Change Problem Merge K Sorted Arrays Find the Single Occurrence Element in an Array (Odd One Out) Rearrange Array Elements (A[i] = i) | In-place Approach 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 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 Print All the Subsets of a Given Set (Power Set) 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) Queue with Stacks: Efficient Implementation Using Stack Operations Alternate Splitting of a given Linked List Reverse a Doubly-Linked List (In-place Algorithm) Swapping Nodes in a Linked List (Kth Position) Print the Bottom View of a Binary Tree Delete X Nodes After Y Nodes In a Linked List Merge a Linked list into another Linked List at Alternate Positions Print The Top View of a Binary Tree Inorder Predecessor and Successor in Binary Search Tree Check if Array Contains All Elements Of Some Given Range Check if Array is Consecutive Integers Find Subarray with Sum Equal to a Target Value Rearrange Array: Positive and Negative Elements Alternating Find Intersection of Two Sorted Arrays 1 2 3 4 5 6 7
