Problems

# Status Problem Level Completes Likes
1

Find The Minimum time difference

Medium % 1
2

Minimum Increments to make all array elements unique

Medium % 1
3

Minimum Deletions to make the occurrence of each character unique.

Hard % 0
4

Given an array, find all unique subsets with a given sum with allowed repeated digits.

Medium % 0
5

Lexicographically next permutation With One swap

Medium % 0
6

Find all subsets of size K from a given number N (1 to N)

Medium % 0
7

Find all possible combinations with sum K from a given number N(1 to N) with the repetition of numbers is allowed

Medium % 0
8

Stable Marriage Problem - Gale–Shapley Algorithm - Java

Hard % 0
9

Construct the largest number from the given array.

Medium % 0
10

Given an array, print all unique subsets with a given sum.

Medium % 0
11

Articulation Points OR Cut Vertices in a Graph

Hard % 0
12

Find the number of distinct Islands OR connected components.

Hard % 1
14

Determine the given routing number belong to which bank

Medium % 0
15

Find all unique combinations of exact K numbers (from 1 to 9 ) with sum to N

Medium % 0
16

Check if Graph is Bipartite - Adjacency List using Depth-First Search(DFS)

Hard % 0
17

Sort a given stack - Using Recursion

Hard % 0
18

Evaluation of Prefix Expressions (Polish Notation) | Set 2

Medium % 0
19

Evaluation of Prefix Expressions (Polish Notation) | Set 1

Medium % 0
20

Check if Arithmetic Expression contains duplicate parenthesis

Medium % 0
21

Introduction to Bipartite Graphs OR Bigraphs

Medium % 1
22

Smallest Number after Removing K digits

Hard % 0
23

Determine the order of Tests when tests have dependencies on each other

Medium % 0
24

Reverse a Stack using recursion - In Place (Without using extra memory)

Hard % 0
25

Convert Prefix to Postfix Expression

Medium % 0
26

Sort a given stack - Using Temporary Stack

Medium % 0
27

Convert Postfix to Prefix Expression

Medium % 0
28

Convert Integer to Roman

Medium % 0
29

Grouping of Anagrams

Medium % 0
30

Convert Postfix to Infix Expression

Medium % 0
31

Convert Infix to Prefix Expression

Medium % 0
32

Max Flow Problem - Ford-Fulkerson Algorithm

Hard % 0
33

Convert Infix to Postfix Expression

Medium % 0
34

Evaluation of Infix expressions

Medium % 0
35

Convert Prefix to Infix Expression

Medium % 0

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.

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

Evaluation of Infix expressions

Convert Prefix to Infix Expression