# Status Problem video Level Completes Likes 466 Lexicographically next permutation With One swap Medium % 1 442 Find the number of distinct Islands OR connected components. 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 392 Reverse a Stack using recursion - In Place (Without using extra memory) Hard % 1 390 Convert Prefix to Postfix Expression Medium % 0 388 Sort a given stack - Using Temporary Stack Medium % 0 387 Convert Postfix to Prefix Expression Medium % 0 377 Convert Postfix to Infix Expression Medium % 0 372 Monotone Increasing Digits - Leetcode Medium % 1 371 Convert Infix to Prefix Expression Medium % 0 368 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 0 365 Convert Infix to Postfix Expression Medium % 0 363 Evaluation of Infix expressions Medium % 0 361 Convert Prefix to Infix Expression Medium % 0 359 Merge K sorted Linked List - Using Priority Queue Hard % 0 346 Valid Brackets – Part 2 | Stack Method Beginner % 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 Lexicographically next permutation With One swap Find the number of distinct Islands OR connected components. 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 Reverse a Stack using recursion - In Place (Without using extra memory) Convert Prefix to Postfix Expression Sort a given stack - Using Temporary Stack Convert Postfix to Prefix Expression Convert Postfix to Infix Expression Monotone Increasing Digits - Leetcode 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 Valid Brackets – Part 2 | Stack Method Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Graph – Detect Cycle in a Directed Graph using colors 1 2 3
