FastPrep

Description

Solutions

Find Contiguous Subarray with Largest Min Plus Max 🐝 -- Not OA but an INTERVIEW Question! 🌷 :)

🤘 INTERN📚RELATED PROBLEMS

Given an array of n positive integers, find a contiguous subarray (containing more than one number) with the largest min + max.

Function Description

Complete the function findContiguousSubarrayWithLargestMinPlusMax in the editor.

findContiguousSubarrayWithLargestMinPlusMax has the following parameter:

int nums[n]: an array of integers

Returns

int: the largest sum of min and max of a contiguous subarray

Note

Solve better than O(n^3)

𓆡 🫧A HUGE THANK YOU TO THE INCREDIBLE RACHEL!𓈒 🧡

Example 1:

Input:  nums = [4, 6, 2, 8, 10]
Output: 18 
Explanation:
      
      The contiguous subarray with the largest min + max is [8, 10], where the min is 8 and the max is 10. 
      Therefore, the answer is 10 + 8 = 18.

Example 2:

Input:  nums = [6, 2, 9, 1, 7]
Output: 11 
Explanation:
      
      The contiguous subarray with the largest min + max is [2, 9], where the min is 2 and the max is 9. 
      Therefore, the answer is 2 + 9 = 11.

Constraints:

🍉