# Status Problem video Level Completes Likes 368 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 0 365 Convert Infix to Postfix Expression Medium % 0 363 Evaluation of Infix expressions Medium % 0 361 Convert Prefix to Infix Expression Medium % 0 360 Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2 Hard % 0 359 Merge K sorted Linked List - Using Priority Queue Hard % 0 354 Valid Multiple Parentheses Medium % 1 346 Valid Brackets – Part 2 | Stack Method Beginner % 0 343 Generate all the strings of length n from 0 to k-1 Medium % 0 310 Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap Hard % 0 280 Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Hard % 0 275 Graph – Detect Cycle in a Directed Graph using colors Hard % 0 274 Graph – Detect Cycle in an Undirected Graph using DFS Medium % 0 273 Graph – Detect Cycle in a Directed Graph Medium % 1 262 Count and print all Subarrays with product less than K in O(n) 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 244 Dynamic programming - Remove Boxes Problem | leetcode Hard % 0 243 Find two non-repeating numbers in an array in O(n) time and O(1) space Hard % 1 241 Separate even and odd integers in a given array Beginner % 0 238 Separate 0’s and 1’s in a given array Beginner % 0 223 Stock Single Sell Problem - Dynamic Programming - O(n) Medium % 2 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 215 Find duplicates in an given array in O(n) time and O(1) space Medium % 0 213 Find the last repeating character in a given string Beginner % 0 212 Find the first non repeating character in a given string Beginner % 0 208 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium % 1 205 Print All Diagonals of a given matrix Medium % 1 204 Dynamic Programming - Edit Distance Problem Hard % 2 Max Flow Problem - Ford-Fulkerson Algorithm Convert Infix to Postfix Expression Evaluation of Infix expressions Convert Prefix to Infix Expression Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2 Merge K sorted Linked List - Using Priority Queue Valid Multiple Parentheses Valid Brackets – Part 2 | Stack Method Generate all the strings of length n from 0 to k-1 Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Graph – Detect Cycle in a Directed Graph using colors Graph – Detect Cycle in an Undirected Graph using DFS Graph – Detect Cycle in a Directed Graph Count and print all Subarrays with product less than K in O(n) 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 - Remove Boxes Problem | leetcode Find two non-repeating numbers in an array in O(n) time and O(1) space Separate even and odd integers in a given array Separate 0’s and 1’s in a given array Stock Single Sell Problem - Dynamic Programming - O(n) 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 Find duplicates in an given array in O(n) time and O(1) space Find the last repeating character in a given string Find the first non repeating character in a given string Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Print All Diagonals of a given matrix Dynamic Programming - Edit Distance Problem 1 2 3 4 5
