# Status Problem video Level Completes Likes 551 Reverse a linked list using stack Medium % 0 489 The number of cycles in a given array of integers. Hard % 0 468 Unique subsets with a given sum with allowed repeated digits. Medium % 0 466 Lexicographically next permutation With One swap Medium % 1 465 Find all subsets of size K from a given number N (1 to N) Medium % 0 462 Stable Marriage Problem - Gale–Shapley Algorithm Hard % 0 457 Given an array, print all unique subsets with a given sum. Medium % 0 444 Articulation Points OR Cut Vertices in a Graph Hard % 0 442 Find the number of distinct Islands OR connected components. Hard % 0 441 Print All Paths in Dijkstra's Shortest Path Algorithm Hard % 0 439 Determine the given routing number belong to which bank Medium % 0 436 Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N Medium % 0 427 Number of Islands using BFS Medium % 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 408 Number of Islands Medium % 1 407 Integer Replacement Problem 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 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 Reverse a linked list using stack The number of cycles in a given array of integers. Unique subsets with a given sum with allowed repeated digits. Lexicographically next permutation With One swap Find all subsets of size K from a given number N (1 to N) Stable Marriage Problem - Gale–Shapley Algorithm Given an array, print all unique subsets with a given sum. Articulation Points OR Cut Vertices in a Graph Find the number of distinct Islands OR connected components. Print All Paths in Dijkstra's Shortest Path Algorithm Determine the given routing number belong to which bank Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N Number of Islands using BFS 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 Number of Islands Integer Replacement Problem 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 1 2