Skip to content

Practice Maximize the Minimum Game Score

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Hard#3449
LeetCode Problem

Maximize the Minimum Game Score

Problem Statement

Start just before points at index -1, with every entry of gameScore equal to zero. In one move, change the position by one step left or right and add points[i] to the score at the destination i. The first move enters index 0, and all subsequent positions must remain inside the array. Using at most m moves, maximize the minimum entry of gameScore and return it.

Source: Maximize the Minimum Game Score on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
points = [2,4], m = 3
Output
4

# Example 2

Input
points = [1,2,3], m = 5
Output
2

Constraints

2 <= n == points.length <= 5 * 10^4
1 <= points[i] <= 10^6
1 <= m <= 10^9

Related LeetCode Problems

Practice more problems similar to Maximize the Minimum Game Score.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.