Problems

# Status Problem Level Completes Likes
36

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap

Hard % 0
37

Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix

Hard % 0
38

Prim’s Algorithm - Minimum Spanning Tree (MST)

Hard % 0
39

Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find)

Hard % 0
40

Disjoint Set | Union-Find Algorithm - Union by rank and path compression

Hard % 0
41

Disjoint Set Data Structure - Union Find Algorithm

Hard % 0
42

Graph – Detect Cycle in a Directed Graph using colors

Hard % 0
43

Snake and Ladder Problem

Hard % 0
44

Count and print all Subarrays with product less than K in O(n)

Hard % 0
45

Sliding Window Algorithm (Track the maximum of each subarray of size k)

Hard % 0
47

Sum of all sub arrays in O(n) Time

Hard % 0
48

Text Justification Problem (OR Word Wrap Problem)

Hard % 0
49

Dynamic Programming - Egg Dropping Problem

Hard % 0
50

Dynamic programming – Minimum Jumps to reach to end

Hard % 0
51

Dynamic programming – Printer Problem

Hard % 0
52

Dynamic programming - Remove Boxes Problem

Hard % 0
53

Find two non-repeating numbers in an array in O(n) time and O(1) space

Hard % 0
54

All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space

Hard % 0
55

Stock Single Sell Problem - O(n) Solution

Hard % 1
56

Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer

Hard % 0
57

k-Nearest Neighbors

Hard % 0
58

Dynamic Programming - Edit Distance Problem

Hard % 1
59

Dynamic Programming - Coin In a Line Game Problem

Hard % 0
60

Dynamic Programming - Box Stacking Problem

Hard % 0
61

Dynamic Programming - Split the String into Minimum number of Palindromes.

Hard % 0
62

Dynamic Programming - Highway Billboard Problem

Hard % 0
63

Convert Binary Tree into Threaded Binary Tree

Hard % 0
64

Double Threaded Binary Tree Complete Implementation

Hard % 0
65

Single Threaded Binary Tree Complete Implementation

Hard % 0
66

Shortest Range in K-sorted Lists

Hard % 1
67

Dynamic Programming — Longest Palindromic Subsequence

Hard % 0
68

Dynamic Programming - Minimum Numbers are Required Whose Square Sum is Equal To a Given Number

Hard % 0

Prim’s – Minimum Spanning Tree (MST) |using Adjacency List and Min Heap

Prim’s - Minimum Spanning Tree (MST) |using Adjacency Matrix

Prim’s Algorithm - Minimum Spanning Tree (MST)

Graph – Find Cycle in Undirected Graph using Disjoint Set (Union-Find)

Disjoint Set | Union-Find Algorithm - Union by rank and path compression

Disjoint Set Data Structure - Union Find Algorithm

Graph – Detect Cycle in a Directed Graph using colors

Snake and Ladder Problem

Count and print all Subarrays with product less than K in O(n)

Sliding Window Algorithm (Track the maximum of each subarray of size k)

Sum of all sub arrays in O(n) Time

Text Justification Problem (OR Word Wrap Problem)

Dynamic Programming - Egg Dropping Problem

Dynamic programming – Minimum Jumps to reach to end

Dynamic programming – Printer Problem

Dynamic programming - Remove Boxes Problem

Find two non-repeating numbers in an array in O(n) time and O(1) space

All elements appears thrice and one element appears once. Find that element in O(n) time and O(1) space

Stock Single Sell Problem - O(n) Solution

Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer

k-Nearest Neighbors

Dynamic Programming - Edit Distance Problem

Dynamic Programming - Coin In a Line Game Problem

Dynamic Programming - Box Stacking Problem

Dynamic Programming - Split the String into Minimum number of Palindromes.

Dynamic Programming - Highway Billboard Problem

Convert Binary Tree into Threaded Binary Tree

Double Threaded Binary Tree Complete Implementation

Single Threaded Binary Tree Complete Implementation

Shortest Range in K-sorted Lists

Dynamic Programming — Longest Palindromic Subsequence

Dynamic Programming - Minimum Numbers are Required Whose Square Sum is Equal To a Given Number