# Status Problem Level Completes Likes 1 Find the number of distinct Islands OR connected components. Hard % 0 2 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 3 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 4 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 5 Convert Prefix to Postfix Expression Medium % 0 6 Convert Postfix to Prefix Expression Medium % 0 7 Convert Postfix to Infix Expression Medium % 0 8 Convert Infix to Prefix Expression Medium % 0 9 Convert Infix to Postfix Expression Medium % 0 10 Evaluation of Infix expressions Medium % 0 11 Convert Prefix to Infix Expression Medium % 0 12 Valid Brackets – Part 2 | Stack Method Beginner % 0 13 Check if Given Number is power of 2. Beginner % 1 14 Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Medium % 1 15 Swap Nodes in pairs in a Linked List by changing links Medium % 0 16 Backtracking - SUDOKU Solver Hard % 0 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 Postfix to Infix Expression Convert Infix to Prefix Expression Convert Infix to Postfix Expression Evaluation of Infix expressions Convert Prefix to Infix Expression Valid Brackets – Part 2 | Stack Method Check if Given Number is power of 2. Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it Swap Nodes in pairs in a Linked List by changing links Backtracking - SUDOKU Solver 1
