Problems

# Status Problem Level Completes Likes
1

Maximum Surpasser in the given array

Hard % 1
2

Maximum Bipartite Matching Problem - Java

Hard % 0
3

Minimum Deletions to make the occurrence of each character unique.

Hard % 0
4

Valid Pickup and Delivery options

Hard % 0
5

Minimum number of adjacent swaps to sort the given array

Hard % 0
6

The number of cycles in a given array of integers.

Hard % 0
7

Efficient Robot Problem - Find Minimum Trips

Hard % 0
8

Stable Marriage Problem - Gale–Shapley Algorithm - Java

Hard % 0
9

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

Hard % 0
10

Articulation Points OR Cut Vertices in a Graph

Hard % 0
11

Find the number of distinct Islands OR connected components.

Hard % 1
13

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

Hard % 0
14

Sort a given stack - Using Recursion

Hard % 0
15

Social Network Problem

Hard % 0
16

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

Hard % 0
17

Round Price Problem

Hard % 0
18

Smallest Number after Removing K digits

Hard % 0
19

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

Hard % 0
20

K-Means Algorithm

Hard % 0
21

Max Flow Problem - Ford-Fulkerson Algorithm

Hard % 0
22

Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2

Hard % 0
23

Merge K sorted Linked List - Using Priority Queue

Hard % 0
24

Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1

Hard % 0
25

Find the nearest building which has bike | Find nearest specific vertex from source in a graph.

Hard % 0
26

Max Flow Problem – Introduction

Hard % 0
27

Dijkstra Algorithm Implementation – TreeSet and Pair Class

Hard % 0
28

Find no of reverse pairs in an array which is sorted in two parts in O(N)

Hard % 0
29

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation

Hard % 0
30

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap – Java Implementation

Hard % 0
31

Dijkstra’s – Shortest Path Algorithm (SPT) - Adjacency Matrix - Java Implementation

Hard % 0
32

Dijkstra's – Shortest Path Algorithm (SPT)

Hard % 0
33

Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Java Implementation

Hard % 0
34

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV)

Hard % 0
35

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key

Hard % 0

Maximum Surpasser in the given array

Maximum Bipartite Matching Problem - Java

Minimum Deletions to make the occurrence of each character unique.

Valid Pickup and Delivery options

Minimum number of adjacent swaps to sort the given array

The number of cycles in a given array of integers.

Efficient Robot Problem - Find Minimum Trips

Stable Marriage Problem - Gale–Shapley Algorithm - Java

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

Articulation Points OR Cut Vertices in a Graph

Find the number of distinct Islands OR connected components.

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

Sort a given stack - Using Recursion

Social Network Problem

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

Round Price Problem

Smallest Number after Removing K digits

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

K-Means Algorithm

Max Flow Problem - Ford-Fulkerson Algorithm

Least Recently Used (LRU) Cache – Using LinkedHashSet and Deque | Set 2

Merge K sorted Linked List - Using Priority Queue

Least Recently Used (LRU) Cache – Using HashMap and Doubly Linked List | Set 1

Find the nearest building which has bike | Find nearest specific vertex from source in a graph.

Max Flow Problem – Introduction

Dijkstra Algorithm Implementation – TreeSet and Pair Class

Find no of reverse pairs in an array which is sorted in two parts in O(N)

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Priority Queue – Java Implementation

Dijkstra’s – Shortest Path Algorithm (SPT) – Adjacency List and Min Heap – Java Implementation

Dijkstra’s – Shortest Path Algorithm (SPT) - Adjacency Matrix - Java Implementation

Dijkstra's – Shortest Path Algorithm (SPT)

Kruskal's Algorithm – Minimum Spanning Tree (MST) - Complete Java Implementation

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue without decrease key in O(ElogV)

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Priority Queue with decrease key