Problems

# Status Problem Level Completes Likes
1

Find The Minimum time difference

Medium % 1
2

Maximum Depth of Valid Nested Parentheses in an arithmetic expression

Medium % 0
3

Maximum overlaps in a given list of time intervals

Medium % 1
4

Remove Duplicates in a given Sorted Array

Beginner % 1
5

Replace Elements with Greatest Element on Right

Beginner % 0
6

Count number of pairs in an array with sum = K

Medium % 0
7

Maximum meetings in one room

Medium % 0
8

Check if given sudoku is valid or not

Medium % 0
9

Find subarray with a sum to given number-2 | Handle negative numbers

Medium % 0
10

Given an array, count the number of pairs with a given sum.

Beginner % 0
11

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

Medium % 0
13

Lexicographically next permutation With One swap

Medium % 0
14

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

Medium % 0
15

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

Medium % 0
16

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

Medium % 0
17

Sum of length of subsets which contains given value K and all elements in subsets are less than equal to K.

Medium % 0
18

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

Medium % 0
19

Check If Given Undirected Graph is a tree

Medium % 0
20

Articulation Points OR Cut Vertices in a Graph

Hard % 0
21

Check the completeness of given binary tree | Set 2 - Using Level Order Traversal

Medium % 0
22

Find the number of distinct Islands OR connected components.

Hard % 1
24

Determine the given routing number belong to which bank

Medium % 0
25

Lexicographically previous permutation With One swap

Medium % 0
26

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

Medium % 0
27

Check the completeness of given binary tree | Set 1 - Using Node Count

Medium % 0
28

Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1.

Medium % 0
29

Number of Islands using BFS

Medium % 0
30

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

Hard % 0
31

Sort a given stack - Using Recursion

Hard % 0
33

Evaluation of Prefix Expressions (Polish Notation) | Set 2

Medium % 0
34

Evaluation of Prefix Expressions (Polish Notation) | Set 1

Medium % 0
35

Number of Islands

Medium % 0

Find The Minimum time difference

Maximum Depth of Valid Nested Parentheses in an arithmetic expression

Maximum overlaps in a given list of time intervals

Remove Duplicates in a given Sorted Array

Replace Elements with Greatest Element on Right

Count number of pairs in an array with sum = K

Maximum meetings in one room

Check if given sudoku is valid or not

Find subarray with a sum to given number-2 | Handle negative numbers

Given an array, count the number of pairs with a given sum.

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

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

Sum of length of subsets which contains given value K and all elements in subsets are less than equal to K.

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

Check If Given Undirected Graph is a tree

Articulation Points OR Cut Vertices in a Graph

Check the completeness of given binary tree | Set 2 - Using Level Order Traversal

Find the number of distinct Islands OR connected components.

Determine the given routing number belong to which bank

Lexicographically previous permutation With One swap

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

Check the completeness of given binary tree | Set 1 - Using Node Count

Collatz Conjecture - Maximum Steps takes to transform (1, N) to 1.

Number of Islands using BFS

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

Number of Islands