HackerRank Split the Phone Numbers Solution

Hello Programmers, In this post, you will learn how to solve HackerRank Split the Phone Numbers Solution. This problem is a part of the Regex HackerRank Series.

One more thing to add, don’t straight away look for the solutions, first try to solve the problems by yourself. If you find any difficulty after trying several times, then look for the solutions. We are going to solve the  Regex HackerRank Solutions using  CPP, JAVA, PYTHON, JavaScript & PHP Programming Languages.

You can practice and submit all HackerRank problem solutions in one place. Find a solution for other domains and Sub-domain. I.e. Hacker Rank solution for HackerRank C ProgrammingHackerRank C++ ProgrammingHackerRank Java Programming, HackerRank Python ProgrammingHackerRank Linux ShellHackerRank SQL Programming, and HackerRank 10 days of Javascript.

HackerRank Split the Phone Numbers Solution
HackerRank Split the Phone Numbers Solution

As you already know that this site does not contain only the Hacker Rank solutions here, you can also find the solution for other problems. I.e. Web Technology, Data StructuresRDBMS ProgramsJava Programs Solutions,  Fiverr Skills Test answersGoogle Course AnswersLinkedin Assessment, and Coursera Quiz Answers.

HackerRank Split the Phone Numbers Solution


There is a list of phone numbers which needs the attention of a text processing expert. As an expert in regular expressions, you are being roped in for the task. A phone number directory can reveal a lot such as country codes and local area codes. The only constraint is that one should know how to process it correctly.

A Phone number is of the following format

[Country code]-[Local Area Code][Number]

There might either be a ‘-‘ ( ascii value 45), or a ‘ ‘ ( space, ascii value 32) between the segments
Where the country and local area codes can have 1-3 numerals each and the number section can have 4-10 numerals each.

And so, if we tried to apply the a regular expression with groups on this phone number: 1-4259854706

We’d get:
Group 1 = 1
Group 2 = 425
Group 3 = 9854706

You will be provided a list of N phone numbers which conform to the pattern described above. Your task is to split it into the country code, local area code and the number.

Input Format

N, where N is the number of tests.
This will be followed by N lines containing N phone numbers in the format specified above.


1 <= N <= 20
There might either be a hyphen, or a space between the segments
The country and local area codes can have 13 numerals each and the number section can have 4-10 numerals each.

Output Format

Your output will contain N lines.
CountryCode=[Country Code],LocalAreaCode=[Local Area Code],Number=[Number]

Recommended Technique

This problem can be solved in many ways, however, try to solve it using regular expressions and groups in order to gain a hands on practice of the concepts involved.

Sample Input

1 877 2638277

Sample Output


Viewing Submissions

You can view others’ submissions if you solve this challenge. Navigate to the challenge leaderboard.

HackerRank Split the Phone Numbers Solution in Cpp

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */
    int t,i,j,f=0,c=0,k;
    string a;
        while(a.at(j)!=' ' && a.at(j)!='-')
        while(a.at(j)!=' ' && a.at(j)!='-')
    return 0;

HackerRank Split the Phone Numbers Solution in Java

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
        String delimiter = "(-| )";
        String[] labels = {"CountryCode", "LocalAreaCode", "Number"};
        Scanner scanIn = new Scanner(System.in);
        int cases = scanIn.nextInt();
        scanIn.nextLine();    // Get rid of the \n after # of cases
        while(cases > 0){
            String[] tokens;
            String line = scanIn.nextLine();
            tokens = line.split(delimiter);
            String output = "";
            for(int i = 0; i < tokens.length; i++){
                output += labels[i];
                output += "=";
                output += tokens[i];
                if(i != 2){
                    output += ",";
            cases --;

HackerRank Split the Phone Numbers Solution in Python

for _ in xrange(t):
    for c in (raw_input()+' '):
            if c== ' ' or c == '-':
    print ans

HackerRank Split the Phone Numbers Solution in JavaScript

process.stdin.on("data", function (input) {
	input = input.match(/^(.*)$/igm);
	var n = parseInt(input[0]),
		strs = input.slice(1,n+1),
		r = /^([^ \-]+).([^ \-]+).([^ \-]+)$/ig;
	for (i=0, j=strs.length; i<j; i+=1) {

HackerRank Split the Phone Numbers Solution in PHP

$_fp = fopen("php://stdin", "r");
/* Enter your code here. Read input from STDIN. Print output to STDOUT */
fscanf($_fp, "%d\n", $count);
for ($i = 0; $i < $count; ++$i) {
$line = trim(fgets($_fp));
$comps = preg_split('/( |-)/', $line, $matches);
echo "CountryCode=$comps[0],LocalAreaCode=$comps[1],Number=$comps[2]\n";


Disclaimer: This problem (Split the Phone Numbers) is generated by HackerRank but the solution is provided by Chase2learn. This tutorial is only for Educational and Learning purposes.


1. How do you solve the first question in HackerRank?

If you want to solve the first question of Hackerrank then you have to decide which programing language you want to practice i.e C programming, Cpp Programing, or Java programming then you have to start with the first program HELLO WORLD.

2. How do I find my HackerRank ID?

You will receive an email from HackerRank to confirm your access to the ID. Once you have confirmed your email, the entry will show up as verified on the settings page. You will also have an option to “Make primary”. Click on that option. Read more

3. Does HackerRank detect cheating?

yes, HackerRank uses a powerful tool to detect plagiarism in the candidates’ submitted code. The Test report of a candidate highlights any plagiarized portions in the submitted code and helps evaluators to verify the integrity of answers provided in the Test.

4. Does HackerRank use camera?

No for coding practice Hackerrank does not use camera but for companies’ interviews code submission time Hackerrank uses the camera.

5. Should I put HackerRank certificate on resume?

These certificates are useless, and you should not put them on your resume. The experience you gained from getting them is not useless. Use it to build a portfolio, and link to it on your resume. 

6. Can I retake HackerRank test?

The company which sent you the HackerRank Test invite owns your Test submissions and results. It’s their discretion to permit a reattempt for a particular Test. If you wish to retake the test, we recommend that you contact the concerned recruiter who invited you to the Test and request a re-invite. 

7. What is HackerRank?

HackerRank is a tech company that focuses on competitive programming challenges for both consumers and businesses. Developers compete by writing programs according to provided specifications. Wikipedia

Finally, we are now, in the end, I just want to conclude some important message for you

Note:- I compile all programs, if there is any case program is not working and showing an error please let me know in the comment section. If you are using adblocker, please disable adblocker because some functions of the site may not work correctly.

Please share our posts on social media platforms and also suggest to your friends to Join Our Groups. Don’t forget to subscribe. 

Sharing Is Caring

Leave a Comment