# Status Problem video Level Completes Likes 426 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 421 Sort a given stack - Using Recursion Hard % 1 419 Print all subsets of an array with a sum equal to zero Medium % 0 416 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 410 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 408 Number of Islands Medium % 1 407 Integer Replacement Problem Medium % 0 402 Check if Arithmetic Expression contains duplicate parenthesis Medium % 0 401 Introduction to Bipartite Graphs OR Bigraphs Medium % 0 396 Optimizing Test Execution: Managing Test Dependencies for Sequential Order Medium % 0 392 Reverse a Stack using recursion - In Place (Without using extra memory) Hard % 1 390 Convert Prefix to Postfix Expression Medium % 0 388 Sort a given stack - Using Temporary Stack Medium % 0 387 Convert Postfix to Prefix Expression Medium % 0 386 Convert Integer to Roman Medium % 0 384 Grouping of Anagrams Medium % 0 377 Convert Postfix to Infix Expression Medium % 0 372 Monotone Increasing Digits - Leetcode Medium % 1 371 Convert Infix to Prefix Expression Medium % 0 368 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 0 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Sort a given stack - Using Recursion Print all subsets of an array with a sum equal to zero Evaluation of Prefix Expressions (Polish Notation) | Set 2 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Number of Islands Integer Replacement Problem Check if Arithmetic Expression contains duplicate parenthesis Introduction to Bipartite Graphs OR Bigraphs Optimizing Test Execution: Managing Test Dependencies for Sequential Order Reverse a Stack using recursion - In Place (Without using extra memory) Convert Prefix to Postfix Expression Sort a given stack - Using Temporary Stack Convert Postfix to Prefix Expression Convert Integer to Roman Grouping of Anagrams Convert Postfix to Infix Expression Monotone Increasing Digits - Leetcode Convert Infix to Prefix Expression Max Flow Problem - Ford-Fulkerson Algorithm 1 2 3 4 5 6 7 8 9 10 11 12
