# Status Problem video Level Completes Likes 271 Snake and Ladder Problem Hard % 1 269 Graph – Depth First Search in Disconnected Graph Medium % 1 267 Graph – Depth First Search using Recursion Beginner % 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 259 Print all sub sequences of a given String Medium % 0 258 Graph – Print all paths between source and destination Medium % 1 256 Print all sub sequences of a given array Hard % 0 255 Print all substrings of a given string Medium % 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 249 Divide and Conquer - Rearrange array elements in special order Medium % 0 248 Remove Duplicates from a string | 4 Approaches Medium % 0 247 Find median of two sorted arrays of same size Medium % 0 246 Dynamic programming – Minimum Jumps to reach to end Hard % 0 245 Dynamic programming – Printer Problem | Leetcode Hard % 0 244 Dynamic programming - Remove Boxes Problem | leetcode Hard % 0 Snake and Ladder Problem Graph – Depth First Search in Disconnected Graph Graph – Depth First Search using Recursion 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 String Graph – Print all paths between source and destination Print all sub sequences of a given array Print all substrings of a given string 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) Divide and Conquer - Rearrange array elements in special order Remove Duplicates from a string | 4 Approaches Find median of two sorted arrays of same size Dynamic programming – Minimum Jumps to reach to end Dynamic programming – Printer Problem | Leetcode Dynamic programming - Remove Boxes Problem | leetcode 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
