Available question text
Given frequencies for characters and a fixed number of keys each supporting a limited number of press levels, assign characters to key-press positions to minimize the total number of presses (sum of frequency × presses) or return -1 if capacity is insufficient; this is a greedy assignment problem of mapping highest-frequency characters to the lowest-press slots.
Related questions
Continue with questions that share topics or the same question type.
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 2268. Minimum Number of Keypresses
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source