Search
⌘K

Leetcode 1535. Find the Winner of an Array Game

Given an array of distinct integers, repeatedly compare the first two elements, keeping the larger at the front and moving the smaller to the back, and return the first element to win k consecutive rounds. Note the process always terminates (the global maximum will win if k is large enough).

Asked at:

Amazon

Amazon


Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Mid September, 2025

Amazon

Amazon

Mid-level

Comments

Your account is free and you can post anonymously if you choose.