FastPrep
Problem · Array

Maximum Size Subarray Sum

Learn this problem
● MediumThe D. E. Shaw Group logoThe D. E. Shaw GroupFULLTIMEOA

Problem statement

Given an array a, create another array b where b[i] is the size of the maximum subarray which includes a[i] and a[i] is the maximum element in that subarray.

Return the sum of all elements of array b.

Function

maximumSizeSubarraySum(a: int[]) → long

Complete the function maximumSizeSubarraySum in the editor.

maximumSizeSubarraySum has the following parameter:

  1. int a[]: an array of integers

Returns

long: the sum of all elements of array b

Examples

Example 1

a = [10, 20, 10, 9, 12, 14]return = 17
The sum of all elements of array b is 1 + 6 + 2 + 1 + 3 + 4 = 17.

Constraints

a.length <= 105

More The D. E. Shaw Group problems

drafts saved locally
public long maximumSizeSubarraySum(int[] a) {
  // write your code here
}
a[10, 20, 10, 9, 12, 14]
expected17
checking account