Skip to content

Practice Minimum Number of Pushes to Type Word I

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#3014
LeetCode Problem

Minimum Number of Pushes to Type Word I

Problem Statement

You are given a string word containing distinct lowercase English letters. Telephone keypads have keys mapped with distinct collections of lowercase English letters, which can be used to form words by pushing them. For example, the key 2 is mapped with ["a","b","c"], we need to push the key one time to type "a", two times to type "b", and three times to type "c" . It is allowed to remap the keys numbered 2 to 9 to distinct collections of letters. The keys can be remapped to any amount of letters, but each letter must be mapped to exactly one key. You need to find the minimum number of times the keys will be pushed to type the string word. Return the minimum number of pushes needed to type word after remapping the keys. An example mapping of letters to keys on a telephone keypad is given below. Note that 1, *, #, and 0 do not map to any letters.

Source: Minimum Number of Pushes to Type Word I on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
word = "abcde"
Output
5

# Example 2

Input
word = "xycdefghij"
Output
12

Constraints

1 <= word.length <= 26
word consists of lowercase English letters.
All letters in word are distinct.

Related LeetCode Problems

Practice more problems similar to Minimum Number of Pushes to Type Word I.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.