LeetCode 3014: Minimum Number of Pushes to Type Word I Solution

Master LeetCode problem 3014 (Minimum Number of Pushes to Type Word I), a easy challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

3014. Minimum Number of Pushes to Type Word I

Easy

Math String Greedy

Problem Explanation

Explanation

To solve this problem, we need to find the minimum number of pushes needed to type a given word after remapping the keys on a telephone keypad. We can achieve this by calculating the distance between the current character and the target character on the keypad for each character in the word.

Create a mapping of characters to the keys on the keypad.
For each character in the word, calculate the minimum number of pushes needed to reach the target key from the current key.
Accumulate the total number of pushes for all characters in the word.

Time Complexity: O(n) where n is the length of the word Space Complexity: O(1)

Solution Code

class Solution {
    public int minPushes(String word) {
        int[] keyMapping = new int[]{1, 2, 3, 4, 5, 6, 7, 8, 9};
        int totalPushes = 0;
        
        for (int i = 0; i < word.length(); i++) {
            char currentChar = word.charAt(i);
            int targetKey = currentChar - 'a' + 2; // Mapping a to key 2
            int currentKey = keyMapping[currentChar - 'a'];
            
            int distance = Math.min(Math.abs(targetKey - currentKey), 9 - Math.abs(targetKey - currentKey)); // Calculate the minimum distance between keys
            totalPushes += distance;
        }
        
        return totalPushes;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 3014 (Minimum Number of Pushes to Type Word I)?

This page provides optimized solutions for LeetCode problem 3014 (Minimum Number of Pushes to Type Word I) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 3014 (Minimum Number of Pushes to Type Word I)?

The time complexity for LeetCode 3014 (Minimum Number of Pushes to Type Word I) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 3014 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 3014 in Java, C++, or Python.

Back to LeetCode Solutions