[Computer Science / Python Algorithm Question]

I need help in Computer Science for Python Algorithm. If you need more information, pleas let me know. Thank you for your time.

Please find the largest sum across all the contiguous (non-empty) subarrays of the input array

The code should have a comment for the logic in order to understand.

The solution has the complexity below,

• Complexity:
  • (2) time
  • (2) space

The output should look like this,

def new_01(arr): Find the largest sum across all the contiguous (non-empty) subarrays of the input array You may assume the input array is not empty You may not assume there is exactly one subarray (that has the largest sum) Parameters arr : a list of integers Returns [the largest sum, the list of all the possible [index of the first element, index of the last element]] : a list of two items, where the first item is an integer and the second item is a list of list # Implementation # Test arr_1 arr_2 arr_3 arr_4 IIII|I11 [2] [-2, 3] [-2, 3, -2, 4, -1, -2] [-2, 3, -2, 4, -1, -2, -10, 5] print(new_01(arr_1)) print(new_01(arr_2)) print(new_01(arr_3)) print(new_01(arr_4)) [2, [[0, 0]]] [3, [[1, 1]]] [5, [[1, 3]]] [5, [[1, 3], [7, 7]]]