# Status Problem video Level Completes Likes 156 Backtracking - N Queens Problem Hard % 0 155 Find the Kth Smallest/Largest Element in an Array Using Heap Beginner % 0 153 Find the Second Largest Element in an Array Beginner % 1 149 Backtracking - Rat In A Maze Puzzle Hard % 0 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 Backtracking - N Queens Problem Find the Kth Smallest/Largest Element in an Array Using Heap Find the Second Largest Element in an Array Backtracking - Rat In A Maze Puzzle 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 1 2 3 4 5 6 7 8 9 10 11 12
