# Status Problem video Level Completes Likes 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 377 Convert Postfix to Infix Expression Medium % 0 371 Convert Infix to Prefix Expression 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 346 Valid Brackets – Part 2 | Stack Method Beginner % 0 251 Dynamic Programming - Egg Dropping Problem Hard % 0 224 Number of 1’s in bit representation of a number Beginner % 1 163 Dynamic Programming - Maximum size square sub-matrix with all 1s Medium % 1 158 Backtracking - Search a Word In a Matrix Hard % 0 33 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
