Sep 25, 2015 ยท So I am attempting to go through the Dynamic Programming track on HackerRank. Problem prompt is as follows. Given an array A={a1,a2,,aN} of N elements, find the maximum possible sum of a. Contiguous subarray Non-contiguous (not necessarily contiguous) subarray. Empty subarrays/subsequences should not be considered. Input Format. "/>