Search
⌘K
Get Premium
Leetcode 3014. Minimum Number of Pushes to Type Word I
Assign distinct letters to 8 telephone keys to minimize total pushes, where the i-th letter on a key costs i pushes. This is a greedy packing problem: place up to 8 letters at cost 1, the next up to 8 at cost 2, and so on, then sum the costs.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.