Given an array of integers, find a subarray with maximum sum? \n\nSolved using Kadane\'s Algorithm\n\nFollow up:\nGiven an array of integers `nums`, find indexes `[i, j]` such that the subarray sum `nums[i] + nums[i+1] ... nums[j-1] + nums[j]` is maximum and `nums[i]` is equal to `nums[j]`\n\nExample:\n\nnums = [1, 3, 5, 6, 3, -6, 3]\n\nAnswer: [1, 4]

Given an array of integers, find a subarray with maximum sum? \n\nSolved using Kadane\'s Algorithm\n\nFollow up:\nGiven an array of integers nums, find indexes 