# Status Problem video Level Completes Likes 553 Minimize Scheduling Headaches: Clone Yourself for Overlapping Events Hard 0.35 % 0 466 Lexicographically next permutation With One swap Medium 0.35 % 1 442 Find the number of distinct Islands OR connected components. Hard 0.17 % 0 441 Print All Paths in Dijkstra's Shortest Path Algorithm Hard 0.17 % 0 426 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard 0.00 % 0 416 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium 0.00 % 0 410 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium 0.00 % 0 396 Optimizing Test Execution: Managing Test Dependencies for Sequential Order Medium 0.17 % 0 390 Convert Prefix to Postfix Expression Medium 0.00 % 0 387 Convert Postfix to Prefix Expression Medium 0.00 % 0 378 Longest contiguous character in a given String - O(N) Solution Beginner 0.17 % 0 377 Convert Postfix to Infix Expression Medium 0.17 % 0 371 Convert Infix to Prefix Expression Medium 0.17 % 0 368 Max Flow Problem - Ford-Fulkerson Algorithm Hard 0.17 % 0 365 Convert Infix to Postfix Expression Medium 0.17 % 0 363 Evaluation of Infix expressions Medium 0.17 % 0 361 Convert Prefix to Infix Expression Medium 0.00 % 0 359 Merge K sorted Linked List - Using Priority Queue Hard 0.35 % 0 344 Given two strings validate the output string Beginner 0.17 % 0 Minimize Scheduling Headaches: Clone Yourself for Overlapping Events Lexicographically next permutation With One swap Find the number of distinct Islands OR connected components. Print All Paths in Dijkstra's Shortest Path Algorithm Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Evaluation of Prefix Expressions (Polish Notation) | Set 2 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Optimizing Test Execution: Managing Test Dependencies for Sequential Order Convert Prefix to Postfix Expression Convert Postfix to Prefix Expression Longest contiguous character in a given String - O(N) Solution Convert Postfix to Infix Expression Convert Infix to Prefix Expression Max Flow Problem - Ford-Fulkerson Algorithm Convert Infix to Postfix Expression Evaluation of Infix expressions Convert Prefix to Infix Expression Merge K sorted Linked List - Using Priority Queue Given two strings validate the output string 1
