# 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 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 206 Reverse the given Array without using built in function Beginner % 0 198 Kadane's Algorithm - Maximum Subarray Problem Medium % 1 131 Find the Height of a tree without using Recursion Medium % 0 36 Find the Maximum Depth OR Height of a Binary Tree Beginner % 1 21 Linked List cycle detection - Tortoise and Hare Algorithm Medium % 0 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 Max Flow Problem - Ford-Fulkerson Algorithm Convert Infix to Postfix Expression Evaluation of Infix expressions Convert Prefix to Infix Expression Reverse the given Array without using built in function Kadane's Algorithm - Maximum Subarray Problem Find the Height of a tree without using Recursion Find the Maximum Depth OR Height of a Binary Tree Linked List cycle detection - Tortoise and Hare Algorithm 1
