# Status Problem Level Completes Likes 1 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 2 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 3 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 4 Convert Prefix to Postfix Expression Medium % 0 5 Convert Postfix to Prefix Expression Medium % 0 6 Convert Postfix to Infix Expression Medium % 0 7 Convert Infix to Prefix Expression Medium % 0 8 Convert Infix to Postfix Expression Medium % 0 9 Evaluation of Infix expressions Medium % 0 10 Convert Prefix to Infix Expression Medium % 0 11 Valid Brackets – Part 2 | Stack Method Beginner % 0 12 Dynamic Programming - Egg Dropping Problem Hard % 0 13 Number of 1’s in bit representation of a number Beginner % 1 14 Dynamic Programming - Maximum size square sub-matrix with all 1s Medium % 1 15 Backtracking - Search a Word In a Matrix Hard % 0 16 Reverse the binary representation of a number. Medium % 1 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 Dynamic Programming - Egg Dropping Problem Number of 1’s in bit representation of a number Dynamic Programming - Maximum size square sub-matrix with all 1s Backtracking - Search a Word In a Matrix Reverse the binary representation of a number. 1
