Available question text
Given a time-ordered list of button press events [index, time], compute each event's duration as the difference from the previous event (first event's duration = its time) and return the button index with the maximum duration, breaking ties by the smallest index.
Related questions
Continue with questions that share topics or the same question type.
- 0/1 Knapsack Problem with Time Complexity Optimization
Coding
- Amount of Time for Binary Tree to Be Infected
Coding · Binary Tree · Breadth-First Search · Depth-First Search
- Average Time of Process per Machine
Coding
- Average Waiting Time
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3386. Button with Longest Push Time
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source