# 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 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 4 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 5 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 6 Convert Prefix to Postfix Expression Medium % 0 7 Convert Postfix to Prefix Expression Medium % 0 8 Convert Integer to Roman Medium % 0 9 Convert Postfix to Infix Expression Medium % 0 10 Convert Infix to Prefix Expression Medium % 0 11 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 0 12 Convert Infix to Postfix Expression Medium % 0 13 Evaluation of Infix expressions Medium % 0 14 Convert Prefix to Infix Expression Medium % 0 15 Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2 Hard % 0 16 Merge K sorted Linked List - Using Priority Queue Hard % 0 17 Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap – Java Implementation Hard % 0 18 Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Hard % 0 19 Text Justification Problem (OR Word Wrap Problem) 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 Convert Prefix to Postfix Expression Convert Postfix to Prefix Expression Convert Integer to Roman 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 Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2 Merge K sorted Linked List - Using Priority Queue Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap – Java Implementation Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Text Justification Problem (OR Word Wrap Problem) 1
