Problems

# Status Problem Level Completes Likes
1

Lexicographically next permutation With One swap

Medium % 0
2

Find the number of distinct Islands OR connected components.

Hard % 1
3

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

Hard % 0
4

Evaluation of Prefix Expressions (Polish Notation) | Set 2

Medium % 0
5

Evaluation of Prefix Expressions (Polish Notation) | Set 1

Medium % 0
6

Convert Prefix to Postfix Expression

Medium % 0
7

Convert Postfix to Prefix Expression

Medium % 0
8

Convert Integer to Roman

Medium % 0
9

Convert Postfix to Infix Expression

Medium % 0
10

Convert Infix to Prefix Expression

Medium % 0
11

Max Flow Problem - Ford-Fulkerson Algorithm

Hard % 0
12

Convert Infix to Postfix Expression

Medium % 0
13

Evaluation of Infix expressions

Medium % 0
14

Convert Prefix to Infix Expression

Medium % 0
15

Merge K sorted Linked List - Using Priority Queue

Hard % 0
16

Generate all the strings of length n from 0 to k-1.

Medium % 0
17

Graph – Detect Cycle in a Directed Graph using colors

Hard % 0
18

Graph – Detect Cycle in an Undirected Graph using DFS

Medium % 0
19

Graph – Detect Cycle in a Directed Graph

Medium % 0
20

Dynamic Programming - Egg Dropping Problem

Hard % 0
21

Nuts & Bolts Problem (Lock & Key problem)

Beginner % 0
22

Majority Element- Boyer–Moore majority vote algorithm

Medium % 0
23

Find the element which appears maximum number of times in the array.

Medium % 0
24

Kadane's Algorithm - Maximum Subarray Problem

Medium % 0
25

Dynamic Programming - Coin Change Problem

Medium % 0
26

Dynamic Programming - Subset Sum Problem

Hard % 0
27

The Word Break Problem

Hard % 0
28

Dynamic Programming - Longest Increasing Subsequence

Medium % 0
29

Backtracking - Knight's Tour Problem

Hard % 0
30

Backtracking - Search a Word In a Matrix

Hard % 0
31

Dynamic Programming - Stairs Climbing Puzzle

Beginner % 0
32

Dynamic Programming - Minimum Coin Change Problem

Medium % 0
34

Reverse The Doubly Linked List

Medium % 0

Lexicographically next permutation With One swap

Find the number of distinct Islands OR connected components.

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

Convert Prefix to Postfix Expression

Convert Postfix to Prefix Expression

Convert Integer to Roman

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

Merge K sorted Linked List - Using Priority Queue

Generate all the strings of length n from 0 to k-1.

Graph – Detect Cycle in a Directed Graph using colors

Graph – Detect Cycle in an Undirected Graph using DFS

Graph – Detect Cycle in a Directed Graph

Dynamic Programming - Egg Dropping Problem

Nuts & Bolts Problem (Lock & Key problem)

Majority Element- Boyer–Moore majority vote algorithm

Find the element which appears maximum number of times in the array.

Kadane's Algorithm - Maximum Subarray Problem

Dynamic Programming - Coin Change Problem

Dynamic Programming - Subset Sum Problem

The Word Break Problem

Dynamic Programming - Longest Increasing Subsequence

Backtracking - Knight's Tour Problem

Backtracking - Search a Word In a Matrix

Dynamic Programming - Stairs Climbing Puzzle

Dynamic Programming - Minimum Coin Change Problem

Reverse The Doubly Linked List