Available question text
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).
Related questions
Continue with questions that share topics or the same question type.
- Find the Winner of the Circular Game
Coding · Array · Math · Queue
- Concatenation of Array
Coding · Array · Simulation
- Asteroid Collision
Coding · Array · Simulation · Stack
- Calculate Amount Paid in Taxes
Coding · Array · Simulation
Sources · 2 references
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Amazon
Leetcode 1535. Find the Winner of an Array Game
Reported Sep 10, 2025 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source
LeetCode company tags · 1 record
Goldman Sachs
Find the Winner of an Array Game
Reported date not specified · Source window: 6mo
Source snapshot: Oct 20, 2026
Source frequency score: 48. This is not an interview probability.
View source