Search
⌘K
Get Premium
Leetcode 3449. Maximize the Minimum Game Score
Given an array points and up to m unit-step moves starting at index -1 where each visit to index i adds points[i] to gameScore[i], find the largest X such that you can schedule ≤m moves so every gameScore[i] ≥ X. The core challenge is a feasibility/optimization under movement constraints (large m and n), typically solved by binary-searching X with a greedy check that counts required visits/movement.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.