# Status Problem video Level Completes Likes 548 Minimum Number of Halls Required for Lecture Scheduling Hard % 1 466 Lexicographically next permutation With One swap Medium % 1 462 Stable Marriage Problem - Gale–Shapley Algorithm - Java Hard % 0 444 Articulation Points OR Cut Vertices in a Graph Hard % 0 442 Find the number of distinct Islands OR connected components. Hard % 0 441 Print All Paths in Dijkstra's Shortest Path Algorithm Hard % 0 426 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 416 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 410 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 390 Convert Prefix to Postfix Expression Medium % 0 387 Convert Postfix to Prefix Expression Medium % 0 383 Print Processes and its messages from a given log file Medium % 0 365 Convert Infix to Postfix Expression Medium % 0 363 Evaluation of Infix expressions Medium % 0 361 Convert Prefix to Infix Expression Medium % 0 198 Kadane's Algorithm - Maximum Subarray Problem Medium % 1 Minimum Number of Halls Required for Lecture Scheduling 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 Kadane's Algorithm - Maximum Subarray Problem 1
