# 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 Valid Brackets – Part 2 | Stack Method Beginner % 0 13 Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Hard % 0 14 Graph – Detect Cycle in a Directed Graph using colors Hard % 0 15 Graph – Detect Cycle in an Undirected Graph using DFS Medium % 0 16 Graph – Detect Cycle in a Directed Graph Medium % 1 17 Snake and Ladder Problem Hard % 1 18 Sliding Window Algorithm (Track the maximum of each subarray of size k) Hard % 0 19 Introduction to Threaded Binary Tree Medium % 0 20 Print All N Length Strings from Given Number K Hard % 0 21 The Word Break Problem Hard % 0 22 Backtracking - Search a Word In a Matrix Hard % 0 23 Print All Possible Valid Combinations Of Parenthesis of Given 'N' Hard % 1 24 Reverse The Doubly Linked List Medium % 0 25 Construct a binary tree from given Inorder and Level Order Traversal Hard % 0 26 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 Valid Brackets – Part 2 | Stack Method Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find) Graph – Detect Cycle in a Directed Graph using colors Graph – Detect Cycle in an Undirected Graph using DFS Graph – Detect Cycle in a Directed Graph Snake and Ladder Problem Sliding Window Algorithm (Track the maximum of each subarray of size k) Introduction to Threaded Binary Tree Print All N Length Strings from Given Number K The Word Break Problem Backtracking - Search a Word In a Matrix Print All Possible Valid Combinations Of Parenthesis of Given 'N' Reverse The Doubly Linked List Construct a binary tree from given Inorder and Level Order Traversal Determine whether given binary tree is binary search tree(BST) or not 1
