Implement pow(x, n) % d. Note that remainders on division cannot be negative. In other words, make sure the answer you return is non-negati

Find the contiguous subarray within an array, A of length N which has the largest sum.