# Status Problem video Level Completes Likes 268 Topological Sort Medium % 1 262 Count and print all Subarrays with product less than K in O(n) Hard % 0 261 Sliding Window Algorithm (Track the maximum of each subarray of size k) Hard % 0 256 Print all sub sequences of a given array Hard % 0 254 Sum of all sub arrays in O(n) Time Hard % 0 253 Print all subarrays of a given array Medium % 1 252 Text Justification Problem (OR Word Wrap Problem) - Leetcode 68 Hard % 0 251 Dynamic Programming - Egg Dropping Problem Hard % 0 250 Nuts & Bolts Problem (Lock & Key problem) Beginner % 0 248 Remove Duplicates from a string | 4 Approaches Medium % 0 247 Find median of two sorted arrays of same size Medium % 0 243 Find two non-repeating numbers in an array in O(n) time and O(1) space Hard % 1 229 Find the increasing OR decreasing point in an array Beginner % 0 227 Algorithm to calculate power(k,n). Beginner % 1 224 Number of 1’s in bit representation of a number Beginner % 1 223 Stock Single Sell Problem - Dynamic Programming - O(n) Medium % 2 222 Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Hard % 0 221 Identifying Maximum Gain from Sequential Elements Medium % 0 217 Find two elements whose sum is closest to zero Medium % 1 216 Find the element which appears maximum number of times in the array Medium % 0 Topological Sort Count and print all Subarrays with product less than K in O(n) Sliding Window Algorithm (Track the maximum of each subarray of size k) Print all sub sequences of a given array Sum of all sub arrays in O(n) Time Print all subarrays of a given array Text Justification Problem (OR Word Wrap Problem) - Leetcode 68 Dynamic Programming - Egg Dropping Problem Nuts & Bolts Problem (Lock & Key problem) Remove Duplicates from a string | 4 Approaches Find median of two sorted arrays of same size Find two non-repeating numbers in an array in O(n) time and O(1) space Find the increasing OR decreasing point in an array Algorithm to calculate power(k,n). Number of 1’s in bit representation of a number Stock Single Sell Problem - Dynamic Programming - O(n) Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Identifying Maximum Gain from Sequential Elements Find two elements whose sum is closest to zero Find the element which appears maximum number of times in the array 1 2 3 4 5 6 7 8 9 10 11 12
