Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in Go

Solution: Minimum Number of Pushes to Type Word II

Explore how to determine the minimum number of key presses required to type a given word by tracking letter frequencies and remapping keys on a telephone keypad. This lesson guides you through using a frequency-based greedy algorithm to assign letters efficiently and minimize typing effort.

We'll cover the following...

Statement

The keys (numbered 22 to 99) on a telephone keypad are associated with specific groups of lowercase English letters. Below is an example of how letters can be mapped to keys on a telephone keypad.

Note: The keys 11, ∗*, 00, and #\# do not map to any letters.

In the above mapping, the key 22 is mapped with letters ["a", "b", "c"]; pressing it once types "a", pressing it twice types "b", and pressing it three times types "c".

Any mapping is possible as long as each letter is assigned to exactly one key, and keys can be mapped to any number of distinct letters.

Given a string, word, consisting of lowercase English letters, return the minimum number of pushes needed to type it after remapping ...