# Status Problem Level Completes Likes 1 Lexicographically next permutation With One swap Medium % 1 2 Find the number of distinct Islands OR connected components. Hard % 0 3 Print All Paths in Dijkstra's Shortest Path Algorithm Hard % 0 4 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 5 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 6 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 7 Determine the order of Tests when tests have dependencies on each other Medium % 0 8 Convert Prefix to Postfix Expression Medium % 0 9 Convert Postfix to Prefix Expression Medium % 0 10 Longest contiguous character in a given String - O(N) Solution Beginner % 0 11 Convert Postfix to Infix Expression Medium % 0 12 Convert Infix to Prefix Expression Medium % 0 13 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 0 14 Convert Infix to Postfix Expression Medium % 0 15 Evaluation of Infix expressions Medium % 0 16 Convert Prefix to Infix Expression Medium % 0 17 Merge K sorted Linked List - Using Priority Queue Hard % 0 18 Given two strings validate the output string Beginner % 0 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 Determine the order of Tests when tests have dependencies on each other 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
