Problems # Status Problem Level Completes Likes 1 Lexicographically next permutation With One swap Medium % 0 2 Stable Marriage Problem - Gale–Shapley Algorithm - Java Hard % 0 3 Articulation Points OR Cut Vertices in a Graph Hard % 0 4 Find the number of distinct Islands OR connected components. Hard % 1 5 Print All Paths in Dijkstra's Shortest Path Algorithm Hard % 0 6 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 7 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 8 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 9 Convert Prefix to Postfix Expression Medium % 0 10 Convert Postfix to Prefix Expression Medium % 0 11 Print Processes and its messages from a given log file Medium % 0 12 Convert Infix to Postfix Expression Medium % 0 13 Evaluation of Infix expressions Medium % 0 14 Convert Prefix to Infix Expression Medium % 0 Lexicographically next permutation With One swap Stable Marriage Problem - Gale–Shapley Algorithm - Java Articulation Points OR Cut Vertices in a Graph 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 Convert Prefix to Postfix Expression Convert Postfix to Prefix Expression Print Processes and its messages from a given log file Convert Infix to Postfix Expression Evaluation of Infix expressions Convert Prefix to Infix Expression 1
