How should I practice Maximum Sum of Heights?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Virtu Financial online assessment problems in FastPrep.

Is Maximum Sum of Heights associated with Virtu Financial?

FastPrep tags this as a Virtu Financial online assessment coding practice problem when the problem catalog has that company and stage context.

Maximum Sum of Heights

Virtu Financial● HardFULLTIMEOA

Learn

Problem statement

You are given positive maximum heights maxHeights. Choose a positive height for every index so that height[i] <= maxHeights[i].

The resulting array must be mountain-shaped: for some peak index, heights do not decrease before the peak and do not increase after it.

Return the maximum possible sum of the chosen heights.

Function

maximumSumOfHeights(maxHeights: int[]) → long

Examples

Example 1

maxHeights = [5,3,4,1,1]return = 13

Choosing [5,3,3,1,1] forms a mountain with sum 13.

Example 2

maxHeights = [6,5,3,9,2,7]return = 22

Using index 3 as the peak allows the mountain [3,3,3,9,2,2], whose sum is 22.

Constraints

1 <= maxHeights.length <= 100000
1 <= maxHeights[i] <= 10^9