Available question text
Given releaseTimes and keysPressed for sequential keypresses, compute each press duration (releaseTimes[0] and releaseTimes[i]-releaseTimes[i-1]) and return the key with the maximum duration, breaking ties by choosing the lexicographically largest key.
Related questions
Continue with questions that share topics or the same question type.
- Alert Using Same Key-Card Three or More Times in a One Hour Period
Coding
- Build a File-Backed Key-Value Store
Coding · File & Media Storage · Key-Value Stores
- Design a lexicographical range key retrieval store
Coding
- Design a persistent key-value store
Coding · Data Structure Design
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 1629. Slowest Key
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source