# Status Problem video Level Completes Likes 478 Efficient Robot Problem - Find Minimum Trips Hard % 0 466 Lexicographically next permutation With One swap Medium % 1 460 Construct the largest number from the given array Medium % 0 442 Find the number of distinct Islands OR connected components. Hard % 0 426 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 416 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 410 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 390 Convert Prefix to Postfix Expression Medium % 0 387 Convert Postfix to Prefix Expression Medium % 0 384 Grouping of Anagrams Medium % 0 377 Convert Postfix to Infix Expression Medium % 0 371 Convert Infix to Prefix Expression Medium % 0 368 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 0 365 Convert Infix to Postfix Expression Medium % 0 363 Evaluation of Infix expressions Medium % 0 361 Convert Prefix to Infix Expression Medium % 0 346 Valid Brackets – Part 2 | Stack Method Beginner % 0 247 Find median of two sorted arrays of same size Medium % 0 195 Single Threaded Binary Tree Complete Implementation Hard % 0 161 The Word Break Problem Hard % 0 160 Dynamic Programming - Longest Increasing Subsequence Medium % 1 158 Backtracking - Search a Word In a Matrix Hard % 0 156 Backtracking - N Queens Problem Hard % 0 90 Find Subarray with Sum Equal to a Target Value Medium % 0 81 Find Nodes X Levels Up from Leaf Nodes in a Tree Medium % 0 79 Calculate Distance Between Nodes in 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 Subarray with Sum Equal to a Target Value Find Nodes X Levels Up from Leaf Nodes in a Tree Calculate Distance Between Nodes in a Binary Tree 1
