Problems

# Status Problem Level Completes Likes
36

Two Sum Problem

Beginner % 0
37

Find if any two intervals overlap in given intervals

Medium % 1
38

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

Medium % 0
40

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

Medium % 0
41

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

Medium % 0
42

Stable Marriage Problem - Gale–Shapley Algorithm - Java

Hard % 0
43

Insert a node in the given sorted linked list.

Beginner % 0
44

Construct the largest number from the given array.

Medium % 0
45

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

Medium % 0
46

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

Medium % 0
47

Replace array elements with maximum element on the right.

Medium % 0
48

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

Medium % 0
49

Activity Selection Problem

Medium % 0
50

Find the sum of overlapping elements in two sets

Beginner % 0
51

Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS)

Hard % 0
52

Check If Given Undirected Graph is a tree

Medium % 0
53

Articulation Points OR Cut Vertices in a Graph

Hard % 0
54

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

Medium % 0
55

Find the number of distinct Islands OR connected components.

Hard % 1
57

Given an array, Print sum of all subsets

Beginner % 0
58

Determine the given routing number belong to which bank

Medium % 0
59

Check if interval is covered in given coordinates

Medium % 0
60

Lexicographically previous permutation With One swap

Medium % 0
61

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

Medium % 0
62

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

Medium % 0
63

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

Medium % 0
64

Number of Islands using BFS

Medium % 0
65

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

Hard % 0
66

Check if the given binary tree is Full or not.

Beginner % 0
68

Sort a given stack - Using Recursion

Hard % 0
69

Number's Complement - 2 Approaches

Medium % 0

Two Sum Problem

Find if any two intervals overlap in given intervals

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

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

Insert a node in the given sorted linked list.

Construct the largest number from the given array.

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.

Replace array elements with maximum element on the right.

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

Activity Selection Problem

Find the sum of overlapping elements in two sets

Check if Graph is Bipartite - Adjacency List using Breadth-First Search(BFS)

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.

Given an array, Print sum of all subsets

Determine the given routing number belong to which bank

Check if interval is covered in given coordinates

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)

Check if the given binary tree is Full or not.

Sort a given stack - Using Recursion

Number's Complement - 2 Approaches