# Status Problem video Level Completes Likes 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 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 1 2 3 4 5 6 7 8
