# 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 Merge K sorted Linked List - Using Priority Queue Hard % 0 13 Valid Brackets – Part 2 | Stack Method Beginner % 0 14 Find duplicates in an given array in O(n) time and O(1) extra space. Medium % 0 15 Dynamic Programming - Highway Billboard Problem Hard % 0 16 Dynamic Programming — Longest Palindromic Subsequence Hard % 1 17 Dynamic Programming - Maximum Product Cutting Problem. Medium % 1 18 Generate Well Ordered Passwords of a Given Length K Medium % 0 19 The Word Break Problem Hard % 0 20 Backtracking - Knight's Tour Problem Hard % 0 21 Dynamic Programming - Minimum Coin Change Problem Medium % 1 22 Reverse The Doubly Linked List Medium % 0 23 Print All The Nodes Which are X distance from the Given Node Hard % 0 24 Print the Vertical Sum in binary Tree Medium % 0 25 Print the Binary Tree in Vertical Order Path. Medium % 0 26 Find Intersection Point in Two Linked List 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 Merge K sorted Linked List - Using Priority Queue Valid Brackets – Part 2 | Stack Method Find duplicates in an given array in O(n) time and O(1) extra space. Dynamic Programming - Highway Billboard Problem Dynamic Programming — Longest Palindromic Subsequence Dynamic Programming - Maximum Product Cutting Problem. Generate Well Ordered Passwords of a Given Length K The Word Break Problem Backtracking - Knight's Tour Problem Dynamic Programming - Minimum Coin Change Problem Reverse The Doubly Linked List Print All The Nodes Which are X distance from the Given Node Print the Vertical Sum in binary Tree Print the Binary Tree in Vertical Order Path. Find Intersection Point in Two Linked List 1
