Understand what the interviewer is asking for by using test cases and questions about the problem. Established a set (2-3) of test cases to verify their own solution later. Established a set (1-2) of ...

This PR adds an implementation of Kadane's Algorithm, an efficient dynamic programming approach to solve the Maximum Subarray Sum problem in O(n) time. Initializes current and global maximum values.