How should I practice Maximum Boat Distance with Resting Energy?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Google onsite interview problems in FastPrep.

Is Maximum Boat Distance with Resting Energy associated with Google?

FastPrep tags this as a Google onsite interview coding practice problem when the problem catalog has that company and stage context.

Maximum Boat Distance with Resting Energy

Google● MediumFULLTIMEONSITE INTERVIEW

Learn

Problem statement

A boat starts with energy k. On day i, it may move only with positive energy, gaining wind[i] distance and losing one energy, or rest, gaining one energy up to the cap k.

Wind may be negative. Return the maximum total distance after all days without allowing energy below zero. Resting is always allowed, so the answer is at least zero.

Function

maximumBoatDistance(k: int, wind: int[]) → long

Examples

Example 1

k = 2wind = [5,1,10]return = 15

Moving on days one and three after resting on day two yields fifteen.

Example 2

k = 1wind = [-5,-2]return = 0

Rest every day for zero distance.

Example 3

k = 0wind = [4,5]return = 0

With zero energy the boat cannot move.

Constraints

0 <= k < 1000.
0 <= wind.length <= 100000.
The answer fits in a signed 64-bit integer.