# Status Problem video Level Completes Likes
310

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

Hard % 0
280

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

Hard % 0
275

Graph – Detect Cycle in a Directed Graph using colors

Hard % 0
271

Snake and Ladder Problem

Hard % 1
235

Majority Element- Boyer–Moore majority vote algorithm

Medium % 0
234

Majority Element – Part 1

Beginner % 0
222

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

Hard % 0
217

Find two elements whose sum is closest to zero

Medium % 1
211

Find the first repeating character in a given string

Beginner % 0
209

Find longest Snake sequence in a given matrix

Medium % 1
208

Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it

Medium % 1
207

Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix

Medium % 1
200

Dynamic Programming - Highway Billboard Problem

Hard % 0
198

Kadane's Algorithm - Maximum Subarray Problem

Medium % 1
186

Reverse a Linked List in groups of given size 'K'

Medium % 0
175

Dynamic Programming — Longest Palindromic Subsequence

Hard % 1
171

Dynamic Programming - Longest Common Subsequence

Medium % 0
165

Generate all combinations of length N

Hard % 0
163

Dynamic Programming - Maximum size square sub-matrix with all 1s

Medium % 1

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

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

Graph – Detect Cycle in a Directed Graph using colors

Snake and Ladder Problem

Majority Element- Boyer–Moore majority vote algorithm

Majority Element – Part 1

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

Find two elements whose sum is closest to zero

Find the first repeating character in a given string

Find longest Snake sequence in a given matrix

Dynamic Programming - Count all paths in 2D Matrix with Obstructions in it

Dynamic Programming - Count all paths from top left to bottom right of a mXn matrix

Dynamic Programming - Highway Billboard Problem

Kadane's Algorithm - Maximum Subarray Problem

Reverse a Linked List in groups of given size 'K'

Dynamic Programming — Longest Palindromic Subsequence

Dynamic Programming - Longest Common Subsequence

Generate all combinations of length N

Dynamic Programming - Maximum size square sub-matrix with all 1s