# Status Problem video Level Completes Likes
526

Maximum Surpasser in the given array

Hard % 0
249

Divide and Conquer - Rearrange array elements in special order

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
102

Merge Sort in a Linked list

Medium % 0
50

Find the first repeated element in an array by its index

Medium % 0
44

Inorder Successor in Binary Tree

Medium % 0
41

Sorted Array to Binary Search Tree of Minimal Height

Medium % 1
19

Exploring All Paths, Including Diagonal, from Top Left to Bottom Right in 2D Array

Medium % 1
18

All Paths from Top Left to Bottom Right in 2D Array

Medium % 0
2

Merge Sort - Updated - Most Efficient ways to Implement

Medium % 1

Maximum Surpasser in the given array

Divide and Conquer - Rearrange array elements in special order

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

Merge Sort in a Linked list

Find the first repeated element in an array by its index

Inorder Successor in Binary Tree

Sorted Array to Binary Search Tree of Minimal Height

Exploring All Paths, Including Diagonal, from Top Left to Bottom Right in 2D Array

All Paths from Top Left to Bottom Right in 2D Array

Merge Sort - Updated - Most Efficient ways to Implement