Leetcode - 1D array

There are few interesting algorithms to approach 1D array problems. First, Kadane’s algorithm. This is useful to find local max in 1D array. Second, two pointer technique. One pointer starts from the beginning of 1D array and another pointer starts f...