# Status Problem video Level Completes Likes 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 377 Convert Postfix to Infix Expression Medium % 0 373 Longest substring with at most two unique characters 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 354 Valid Multiple Parentheses Medium % 1 271 Snake and Ladder Problem Hard % 1 262 Count and print all Subarrays with product less than K in O(n) Hard % 0 258 Graph – Print all paths between source and destination Medium % 1 256 Print all sub sequences of a given array Hard % 0 253 Print all subarrays of a given array Medium % 1 239 Find local minimum or local maximum in O(1) Medium % 0 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 Convert Postfix to Infix Expression Longest substring with at most two unique characters 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 Multiple Parentheses Snake and Ladder Problem Count and print all Subarrays with product less than K in O(n) Graph – Print all paths between source and destination Print all sub sequences of a given array Print all subarrays of a given array Find local minimum or local maximum in O(1) 1 2 3 4
