# Status Problem Level Completes Likes 1 Maximum Surpasser in the given array Hard % 0 2 Divide and Conquer - Rearrange array elements in special order Medium % 0 3 Find the local minima in a given array Medium % 0 4 Stock Single Sell Problem - O(n) Solution Hard % 2 5 Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Hard % 0 6 Maximum difference between two elements where larger element appears after the smaller element Medium % 0 7 Merge Sort in a Linked list Medium % 0 8 Find the first repeated element in an array by its index Medium % 0 9 Inorder Successor in Binary Tree Medium % 0 10 Sorted Array to Binary Search Tree of Minimal Height Medium % 1 11 Count All Paths from Top left to bottom right in Two Dimensional Array including Diagonal Paths Medium % 1 12 Print All Paths from Top left to bottom right in Two Dimensional Array Medium % 0 13 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 - O(n) Solution Maximum Subarray OR Largest Sum Contiguous Subarray Problem – Divide and Conquer Maximum difference between two elements where larger element appears after the smaller element 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 Count All Paths from Top left to bottom right in Two Dimensional Array including Diagonal Paths Print All Paths from Top left to bottom right in Two Dimensional Array Merge Sort - Updated - Most Efficient ways to Implement 1
