Problems # Status Problem Level Completes Likes 1 The number of cycles in a given array of integers. Hard % 0 2 Given an array, find all unique subsets with a given sum with allowed repeated digits. Medium % 0 3 Lexicographically next permutation With One swap Medium % 0 4 Find all subsets of size K from a given number N (1 to N) Medium % 0 5 Stable Marriage Problem - Gale–Shapley Algorithm - Java Hard % 0 6 Given an array, print all unique subsets with a given sum. Medium % 0 7 Articulation Points OR Cut Vertices in a Graph Hard % 0 8 Find the number of distinct Islands OR connected components. Hard % 1 9 Print All Paths in Dijkstra's Shortest Path Algorithm Hard % 1 10 Determine the given routing number belong to which bank Medium % 0 11 Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N Medium % 0 12 Number of Islands using BFS Medium % 0 13 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 14 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 15 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 16 Number of Islands Medium % 0 17 Minimum No of operations required to convert a given number to 1 - Integer Replacement Problem. Medium % 0 18 Determine the order of Tests when tests have dependencies on each other Medium % 0 19 Reverse a Stack using recursion - In Place (Without using extra memory) Hard % 0 20 Convert Prefix to Postfix Expression Medium % 0 21 Sort a given stack - Using Temporary Stack Medium % 0 22 Convert Postfix to Prefix Expression Medium % 0 23 Convert Integer to Roman Medium % 0 24 Convert Postfix to Infix Expression Medium % 0 25 Longest substring with at most two unique characters Medium % 0 26 Convert Infix to Prefix Expression Medium % 0 27 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 0 28 Convert Infix to Postfix Expression Medium % 0 29 Evaluation of Infix expressions Medium % 0 30 Convert Prefix to Infix Expression Medium % 0 31 Snake and Ladder Problem Hard % 0 32 Count and print all Subarrays with product less than K in O(n) Hard % 0 33 Graph – Print all paths between source and destination Medium % 0 34 Print all sub sequences of a given array Hard % 0 35 Print all subarrays of a given array Medium % 0 The number of cycles in a given array of integers. Given an array, find all 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 - Java 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 Minimum No of operations required to convert a given number to 1 - Integer Replacement Problem. Determine the order of Tests when tests have dependencies on each other 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 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 1 2