# Status Problem video Level Completes Likes 199 Dynamic Programming - Maximum Subarray Problem Medium % 0 198 Kadane's Algorithm - Maximum Subarray Problem Medium % 1 188 Shortest Range in K-sorted Lists Hard % 1 185 Generate Maximum revenue by selling K tickets from N windows Medium % 0 172 Dynamic Programming - Longest Common Substring Medium % 0 171 Dynamic Programming - Longest Common Subsequence Medium % 0 168 Dynamic Programming - Minimum Cost Path Problem Medium % 1 160 Dynamic Programming - Longest Increasing Subsequence Medium % 1 157 Backtracking - N Queens Problem - Better Solution Hard % 0 155 Find the Kth Smallest/Largest Element in an Array Using Heap Beginner % 0 154 Priority Queue in Data Structure Beginner % 0 153 Find the Second Largest Element in an Array Beginner % 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 139 Find Missing Numbers in Sequences - XOR Method Beginner % 1 129 Binary Min-Max Heap Implementation Hard % 0 128 Magic Index - Find Index In Sorted Array Such That A[i] = i 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 Dynamic Programming - Maximum Subarray Problem Kadane's Algorithm - Maximum Subarray Problem Shortest Range in K-sorted Lists Generate Maximum revenue by selling K tickets from N windows Dynamic Programming - Longest Common Substring Dynamic Programming - Longest Common Subsequence Dynamic Programming - Minimum Cost Path Problem Dynamic Programming - Longest Increasing Subsequence Backtracking - N Queens Problem - Better Solution Find the Kth Smallest/Largest Element in an Array Using Heap Priority Queue in Data Structure Find the Second Largest Element in an Array Merge K Sorted Arrays Find the Single Occurrence Element in an Array (Odd One Out) Rearrange Array Elements (A[i] = i) | In-place Approach Find Missing Numbers in Sequences - XOR Method Binary Min-Max Heap Implementation Magic Index - Find Index In Sorted Array Such That A[i] = i 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
