# 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 Majority Element – Part 1 Beginner % 0 13 Reverse a Linked List in groups of given size 'K' Medium % 0 14 Dynamic Programming — Longest Palindromic Subsequence Hard % 1 15 Do the Reverse Level Order Traversal in a binary tree Medium % 0 16 Swap Kth Node from the front with the Kth Node from the End Medium % 0 17 Construct a binary tree from given Inorder and Postorder Traversal Hard % 0 18 Determine whether given binary tree is binary search tree(BST) or not 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 Max Flow Problem - Ford-Fulkerson Algorithm Convert Infix to Postfix Expression Evaluation of Infix expressions Convert Prefix to Infix Expression Majority Element – Part 1 Reverse a Linked List in groups of given size 'K' Dynamic Programming — Longest Palindromic Subsequence Do the Reverse Level Order Traversal in a binary tree Swap Kth Node from the front with the Kth Node from the End Construct a binary tree from given Inorder and Postorder Traversal Determine whether given binary tree is binary search tree(BST) or not 1
