Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Convert a sentence into its equivalent mobile numeric keypad sequence

  • Difficulty Level : Easy
  • Last Updated : 24 Nov, 2021

Given a sentence in the form of a string, convert it into its equivalent mobile numeric keypad sequence. 
 

Mobile-keypad

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

Examples : 
 



Input : GEEKSFORGEEKS
Output : 4333355777733366677743333557777
For obtaining a number, we need to press a
number corresponding to that character for 
number of times equal to position of the 
character. For example, for character C, 
we press number 2 three times and accordingly.

Input : HELLO WORLD
Output : 4433555555666096667775553

 

Recommended: Please try your approach on {IDE} first, before moving on to the solution.

Follow the steps given below to convert a sentence into its equivalent mobile numeric keypad sequence. 
 

  • For each character, store the sequence which should be obtained at its respective position in an array, i.e. for Z, store 9999. For Y, store 999. For K, store 55 and so on.
  • For each character, subtract ASCII value of ‘A’ and obtain the position in the array pointed 
    by that character and add the sequence stored in that array to a string.
  • If the character is a space, store 0
  • Print the overall sequence.

Below is the implementation of above method : 
 

C++




// C++ implementation to convert a
// sentence into its equivalent
// mobile numeric keypad sequence
#include <bits/stdc++.h>
using namespace std;
 
// Function which computes the sequence
string printSequence(string arr[],
                       string input)
{
    string output = "";
 
    // length of input string
    int n = input.length();
    for (int i=0; i<n; i++)
    {
        // Checking for space
        if (input[i] == ' ')
            output = output + "0";
 
        else
        {
            // Calculating index for each
            // character
            int position = input[i]-'A';
            output = output + arr[position];
        }
    }
 
    // Output sequence
    return output;
}
 
// Driver function
int main()
{
    // storing the sequence in array
    string str[] = {"2","22","222",
                    "3","33","333",
                    "4","44","444",
                    "5","55","555",
                    "6","66","666",
                    "7","77","777","7777",
                    "8","88","888",
                    "9","99","999","9999"
                   };
 
    string input = "GEEKSFORGEEKS";
    cout << printSequence(str, input);
    return 0;
}
Java



// Java implementation to convert a
// sentence into its equivalent
// mobile numeric keypad sequence
import java.util.*;
 
class GFG
{
 
    // Function which computes the sequence
    static String printSequence(String arr[],
                               String input)
    {
        String output = "";
     
        // length of input string
        int n = input.length();
        for (int i = 0; i < n; i++)
        {
            // Checking for space
            if (input.charAt(i) == ' ')
                output = output + "0";
     
            else
            {
                // Calculating index for each
                // character
                int position = input.charAt(i) - 'A';
                output = output + arr[position];
            }
        }
     
        // Output sequence
        return output;
    }
     
    // Driver Function
    public static void main(String[] args)
    {
        // storing the sequence in array
        String str[] = {"2","22","222",
                        "3","33","333",
                        "4","44","444",
                        "5","55","555",
                        "6","66","666",
                        "7","77","777","7777",
                        "8","88","888",
                        "9","99","999","9999"
                    };
 
        String input = "GEEKSFORGEEKS";
        System.out.println(printSequence(str, input));
    }
}
 
// This code is contributed by Gitanjali.
Python3



# Python3 implementation to convert
# a sentence into its equivalent
# mobile numeric keypad sequence
 
# Function which computes the
# sequence
def printSequence(arr, input):
 
# length of input string
    n = len(input)
    output = ""
     
    for i in range(n):
     
        # checking for space
        if(input[i] == ' '):
            output = output + "0"
        else:
            # calculating index for each
            # character        
            position = ord(input[i]) - ord('A')
            output = output + arr[position]
    # output sequence    
    return output
     
# Driver code
str = ["2", "22", "222",
       "3", "33", "333",
       "4", "44", "444",
       "5", "55", "555",
       "6", "66", "666",
       "7", "77", "777", "7777",
       "8", "88", "888",
       "9", "99", "999", "9999" ]
 
input = "GEEKSFORGEEKS";
print( printSequence(str, input))
 
# This code is contributed by upendra bartwal
C#



// C# implementation to convert a
// sentence into its equivalent
// mobile numeric keypad sequence
using System;
 
class GFG
{
 
    // Function which computes the sequence
    static String printSequence(string []arr,
                            string input)
    {
        string output = "";
     
        // length of input string
        int n = input.Length;
        for (int i = 0; i < n; i++)
        {
            // Checking for space
            if (input[i] == ' ')
                output = output + "0";
     
            else
            {
                // Calculating index for each
                // character
                int position = input[i] - 'A';
                output = output + arr[position];
            }
        }
     
        // Output sequence
        return output;
    }
     
    // Driver Function
    public static void Main()
    {
        // storing the sequence in array
        string []str = {"2","22","222",
                        "3","33","333",
                        "4","44","444",
                        "5","55","555",
                        "6","66","666",
                        "7","77","777","7777",
                        "8","88","888",
                        "9","99","999","9999"
                    };
 
        string input = "GEEKSFORGEEKS";
        Console.WriteLine(printSequence(str, input));
    }
}
 
// This code is contributed by vt_m.
PHP



<?php
// PHP implementation to convert a
// sentence into its equivalent
// mobile numeric keypad sequence
 
// Function which computes the sequence
function printSequence(&$arr, $input)
{
    $output = "";
 
    // length of input string
    $n = strlen($input);
    for ($i = 0; $i < $n; $i++)
    {
        // Checking for space
        if ($input[$i] == ' ')
            $output = $output + "0";
 
        else
        {
            // Calculating index for each
            // character
            $position = ord($input[$i]) - ord('A');
            $output = $output . $arr[$position];
        }
    }
 
    // Output sequence
    return $output;
}
 
// Driver Code
 
// storing the sequence in array
$str = array("2","22","222", "3","33","333",
             "4","44","444", "5","55","555",
             "6","66","666", "7","77","777","7777",
             "8","88","888", "9","99","999","9999");
 
$input = "GEEKSFORGEEKS";
echo printSequence($str, $input);
 
// This code is contributed by ita_c
?>
Javascript



<script>
 
// Javascript implementation to convert a
// sentence into its equivalent
// mobile numeric keypad sequence
     
    // Function which computes the sequence
    function printSequence(arr,input)
    {
        let output = "";
       
        // length of input string
        let n = input.length;
        for (let i = 0; i < n; i++)
        {
            // Checking for space
            if (input[i] == ' ')
                output = output + "0".charCodeAt(0);
       
            else
            {
                // Calculating index for each
                // character
                let position = input[i].charCodeAt(0) - 'A'.charCodeAt(0);
                output = output + arr[position];
            }
        }
       
        // Output sequence
        return output;
    }
     
    // Driver Function
    let str = ["2", "22", "222",
       "3", "33", "333",
       "4", "44", "444",
       "5", "55", "555",
       "6", "66", "666",
       "7", "77", "777", "7777",
       "8", "88", "888",
       "9", "99", "999", "9999" ]
     
    let input = "GEEKSFORGEEKS";
    document.write(printSequence(str, input));
     
    // This code is contributed by avanitrachhadiya2155
</script>
Output : 
 
4333355777733366677743333557777
Time complexity : O(n) 
 
 



My Personal Notes
arrow_drop_up
Previous
Design Media Sharing Social Networking System
Next

Average of given numbers in Bash
Recommended Articles
Page :
Convert a Mobile Numeric Keypad sequence to equivalent sentence
30, Apr 21
Mobile Numeric Keypad Problem
26, Sep 14
Print given sentence into its equivalent ASCII form
25, Dec 17
Convert the ASCII value sentence to its equivalent string
14, Mar 19
Count of buttons pressed in a keypad mobile
13, Mar 19
Split a Numeric String into Fibonacci Sequence
18, Jul 20
Remove uppercase, lowercase, special, numeric, and non-numeric characters from a String
05, Oct 20
Frequency of smallest character in first sentence less than that of second sentence
30, Apr 20
Check whether the string can be printed using same row of qwerty keypad
07, May 20
Convert given Float value to equivalent Fraction
23, Oct 20
Convert an unbalanced bracket sequence to a balanced sequence
19, Aug 19
Convert String into Binary Sequence
08, Mar 18
Check if a numeric string can be split into substrings having difference between consecutive numbers equal to K
18, Jun 21
Divide given numeric string into at most two increasing subsequences which form an increasing string upon concatenation
03, Sep 21
Split a sentence into words in C++
09, May 18
Minimum number of adjacent swaps to convert a string into its given anagram
26, Jun 19
Count of substrings whose Decimal equivalent is greater than or equal to K
24, Mar 20
Check whether the binary equivalent of a number ends with given string or not
30, Jun 20
Minimum insertions or deletions required to make two strings K-equivalent
19, Jan 21
Count of distinct groups of strings formed after performing equivalent operation
30, Sep 21
Check whether two strings are equivalent or not according to given condition
12, Feb 19
Maximize the decimal equivalent by flipping only a contiguous set of 0s
06, May 20
k-th missing element in increasing sequence which is not present in a given sequence
17, Oct 17
Minimum operations required to transform a sequence of numbers to a sequence where a[i]=a[i+2]
30, Oct 18
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
parthendo
@parthendo
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!