# 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 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 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 Reverse the given Array without using built in function Beginner % 0 13 Kadane's Algorithm - Maximum Subarray Problem Medium % 1 14 Find the Height of a tree without using Recursion Medium % 0 15 Find the Maximum Depth OR Height of a Binary Tree Beginner % 1 16 Find the Loop in a Linked list, find its length and Break the Loop 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 Find the Loop in a Linked list, find its length and Break the Loop 1
