# Status Problem video Level Completes Likes
284

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

Hard % 0
283

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

Hard % 1
282

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

Hard % 0
281

Prim’s Algorithm - Minimum Spanning Tree (MST)

Hard % 0
280

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

Hard % 0
279

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

Hard % 0
278

Disjoint Set Data Structure - Union Find Algorithm

Hard % 0
275

Graph – Detect Cycle in a Directed Graph using colors

Hard % 0
271

Snake and Ladder Problem

Hard % 1
262

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

Hard % 0
261

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

Hard % 0
254

Sum of all sub arrays in O(n) Time

Hard % 0
252

Text Justification Problem (OR Word Wrap Problem) - Leetcode 68

Hard % 0
251

Dynamic Programming - Egg Dropping Problem

Hard % 0
246

Dynamic programming – Minimum Jumps to reach to end

Hard % 0
245

Dynamic programming – Printer Problem | Leetcode

Hard % 0
244

Dynamic programming - Remove Boxes Problem | leetcode

Hard % 0
243

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

Hard % 1
240

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

Hard % 1
222

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

Hard % 0
210

k-Nearest Neighbors

Hard % 0
204

Dynamic Programming - Edit Distance Problem

Hard % 2
203

Dynamic Programming - Coin In a Line Game Problem

Hard % 0
202

Dynamic Programming - Box Stacking Problem

Hard % 0
201

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

Hard % 0
200

Dynamic Programming - Highway Billboard Problem

Hard % 0
197

Convert Binary Tree into Threaded Binary Tree

Hard % 0
196

Double Threaded Binary Tree Complete Implementation

Hard % 0
195

Single Threaded Binary Tree Complete Implementation

Hard % 0
188

Shortest Range in K-sorted Lists

Hard % 1
175

Dynamic Programming — Longest Palindromic Subsequence

Hard % 1
173

Minimize Square Sums: Fewest Perfect Squares to Reach a Target (Dynamic Programming)

Hard % 0
165

Generate all combinations of length N

Hard % 0

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

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) - Leetcode 68

Dynamic Programming - Egg Dropping Problem

Dynamic programming – Minimum Jumps to reach to end

Dynamic programming – Printer Problem | Leetcode

Dynamic programming - Remove Boxes Problem | leetcode

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

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

Minimize Square Sums: Fewest Perfect Squares to Reach a Target (Dynamic Programming)

Generate all combinations of length N