int maxSum = Integer.MIN_VALUE; // To store maximum subarray sum int currentSum = 0; // To store the sum of the current subarray int start = 0; // To track the starting index of the subarray int end = ...

The time complexity of this code is O(n), where n is the length of the array nums. The algorithm iterates through the array once, and for each element, it performs constant-time operations. Therefore, ...