# Status Problem Level Completes Likes 1 Efficient Robot Problem - Find Minimum Trips Hard % 0 2 Lexicographically next permutation With One swap Medium % 1 3 Construct the largest number from the given array. Medium % 0 4 Find the number of distinct Islands OR connected components. Hard % 0 5 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 6 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 7 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 8 Convert Prefix to Postfix Expression Medium % 0 9 Convert Postfix to Prefix Expression Medium % 0 10 Grouping of Anagrams Medium % 0 11 Convert Postfix to Infix Expression Medium % 0 12 Convert Infix to Prefix Expression Medium % 0 13 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 0 14 Convert Infix to Postfix Expression Medium % 0 15 Evaluation of Infix expressions Medium % 0 16 Convert Prefix to Infix Expression Medium % 0 17 Valid Brackets – Part 2 | Stack Method Beginner % 0 18 Find median of two sorted arrays of same size Medium % 0 19 Single Threaded Binary Tree Complete Implementation Hard % 0 20 The Word Break Problem Hard % 0 21 Dynamic Programming - Longest Increasing Subsequence Medium % 1 22 Backtracking - Search a Word In a Matrix Hard % 0 23 Backtracking - N Queens Problem Hard % 0 24 Find the subarray with sum to a Given Value. Medium % 0 25 Print All The Nodes Which are X distance from the Leaf Nodes Medium % 0 26 Find the Distance between Two Nodes of a Binary Tree. Hard % 0 Efficient Robot Problem - Find Minimum Trips Lexicographically next permutation With One swap Construct the largest number from the given array. Find the number of distinct Islands OR connected components. 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 Grouping of Anagrams 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 Find median of two sorted arrays of same size Single Threaded Binary Tree Complete Implementation The Word Break Problem Dynamic Programming - Longest Increasing Subsequence Backtracking - Search a Word In a Matrix Backtracking - N Queens Problem Find the subarray with sum to a Given Value. Print All The Nodes Which are X distance from the Leaf Nodes Find the Distance between Two Nodes of a Binary Tree. 1
