# Status Problem video Level Completes Likes
267

Graph – Depth First Search using Recursion

Beginner % 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
258

Graph – Print all paths between source and destination

Medium % 1
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
250

Nuts & Bolts Problem (Lock & Key problem)

Beginner % 0
249

Divide and Conquer - Rearrange array elements in special order

Medium % 0
248

Remove Duplicates from a string | 4 Approaches

Medium % 0
247

Find median of two sorted arrays of same size

Medium % 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
239

Find local minimum or local maximum in O(1)

Medium % 0
235

Majority Element- Boyer–Moore majority vote algorithm

Medium % 0
233

Find the local minima in a given array

Medium % 0
223

Stock Single Sell Problem - Dynamic Programming - O(n)

Medium % 2
222

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

Hard % 0
221

Identifying Maximum Gain from Sequential Elements

Medium % 0
219

Find the two repeating elements in a given array | 6 Approaches

Medium % 1
216

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

Medium % 0
215

Find duplicates in an given array in O(n) time and O(1) space

Medium % 0
213

Find the last 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
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

Graph – Depth First Search using Recursion

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)

Graph – Print all paths between source and destination

Sum of all sub arrays in O(n) Time

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

Dynamic Programming - Egg Dropping Problem

Nuts & Bolts Problem (Lock & Key problem)

Divide and Conquer - Rearrange array elements in special order

Remove Duplicates from a string | 4 Approaches

Find median of two sorted arrays of same size

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

Find local minimum or local maximum in O(1)

Majority Element- Boyer–Moore majority vote algorithm

Find the local minima in a given array

Stock Single Sell Problem - Dynamic Programming - O(n)

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

Identifying Maximum Gain from Sequential Elements

Find the two repeating elements in a given array | 6 Approaches

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

Find duplicates in an given array in O(n) time and O(1) space

Find the last 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 - Edit Distance Problem

Dynamic Programming - Coin In a Line Game Problem

Dynamic Programming - Box Stacking Problem