Leetcode 1629. Slowest Key

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.

Question Timeline

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

Company

Level

Region

Comments

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

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 1629. Slowest Key

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact