Question — Given an integer array nums, find the subarray with the largest sum, and return its sum. Example 1: Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: The subarray [4,-1,2,1] has the largest sum 6.
Example 2: Input: nums = [1]
Output: 1
Explanation: The subarray [1] has the largest sum 1.
Example 3: Solution — 1- we can use brute force algorithm with 3 loop -> o(n3) 2- we can use brute force algorithm with 2 loop -> o(n2)