# Status Problem Level Completes Likes 1 Maximizing Contiguous Ones with a Single Flip in a Binary Array Medium % 2 2 Counting the Largest Number Groups by Digit Sum Medium % 2 3 Find The Minimum time difference Medium % 1 4 Minimum Increments to make all array elements unique Medium % 0 5 Minimum Deletions to make the occurrence of each character unique. Hard % 1 6 Given an array, find all unique subsets with a given sum with allowed repeated digits. Medium % 0 7 Lexicographically next permutation With One swap Medium % 1 8 Find all subsets of size K from a given number N (1 to N) Medium % 0 9 Find all possible combinations with sum K from a given number N(1 to N) with the repetition of numbers is allowed Medium % 0 10 Stable Marriage Problem - Gale–Shapley Algorithm - Java Hard % 0 11 Construct the largest number from the given array. Medium % 0 12 Given an array, print all unique subsets with a given sum. Medium % 0 13 Articulation Points OR Cut Vertices in a Graph Hard % 0 14 Find the number of distinct Islands OR connected components. Hard % 0 15 Print All Paths in Dijkstra's Shortest Path Algorithm Hard % 0 16 Determine the given routing number belong to which bank Medium % 0 17 Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N Medium % 0 18 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Hard % 0 19 Sort a given stack - Using Recursion Hard % 1 20 Evaluation of Prefix Expressions (Polish Notation) | Set 2 Medium % 0 21 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Medium % 0 22 Check if Arithmetic Expression contains duplicate parenthesis Medium % 0 23 Introduction to Bipartite Graphs OR Bigraphs Medium % 0 24 Smallest Number after Removing K digits Hard % 0 25 Determine the order of Tests when tests have dependencies on each other Medium % 0 26 Reverse a Stack using recursion - In Place (Without using extra memory) Hard % 1 27 Convert Prefix to Postfix Expression Medium % 0 28 Sort a given stack - Using Temporary Stack Medium % 0 29 Convert Postfix to Prefix Expression Medium % 0 30 Convert Integer to Roman Medium % 0 31 Grouping of Anagrams Medium % 0 32 Convert Postfix to Infix Expression Medium % 0 33 Convert Infix to Prefix Expression Medium % 0 34 Max Flow Problem - Ford-Fulkerson Algorithm Hard % 0 35 Convert Infix to Postfix Expression Medium % 0 Maximizing Contiguous Ones with a Single Flip in a Binary Array Counting the Largest Number Groups by Digit Sum Find The Minimum time difference Minimum Increments to make all array elements unique Minimum Deletions to make the occurrence of each character unique. 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) Find all possible combinations with sum K from a given number N(1 to N) with the repetition of numbers is allowed Stable Marriage Problem - Gale–Shapley Algorithm - Java Construct the largest number from the given array. 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 Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS) Sort a given stack - Using Recursion Evaluation of Prefix Expressions (Polish Notation) | Set 2 Evaluation of Prefix Expressions (Polish Notation) | Set 1 Check if Arithmetic Expression contains duplicate parenthesis Introduction to Bipartite Graphs OR Bigraphs Smallest Number after Removing K digits 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 Grouping of Anagrams Convert Postfix to Infix Expression Convert Infix to Prefix Expression Max Flow Problem - Ford-Fulkerson Algorithm Convert Infix to Postfix Expression 1 2 3 4
