Hello **Programmers/Coders,** Today we are going to share ** solutions of Programming problems of HackerRank, Algorithm Solutions of Problem Solving Section in Java**. At Each Problem with Successful submission with

**all Test Cases Passed,**you will get an score or marks. And after solving maximum problems, you will be getting stars. This will highlight your profile to the recruiters.

In this post, you will find the solution for **Separate the Numbers** **in Java-HackerRank Problem**. We are providing the **correct and tested solutions** of coding problems present on **HackerRank**. If you are not able to solve any problem, then you can take help from our Blog/website.

Use “Ctrl+F” To Find Any Questions Answer. & For Mobile User, You Just Need To Click On Three dots In Your Browser & You Will Get A “Find” Option There. Use These Option to Get Any Random Questions Answer.

**Introduction To Algorithm**

The word **Algorithm** means “a process or set of rules to be followed in calculations or other problem-solving operations”. Therefore Algorithm refers to a set of rules/instructions that step-by-step define how a work is to be executed upon in order to get the expected results.

**Advantages of Algorithms:**

- It is easy to understand.
- Algorithm is a step-wise representation of a solution to a given problem.
- In Algorithm the problem is broken down into smaller pieces or steps hence, it is easier for the programmer to convert it into an actual program.

** Link for the Problem** – Separate the Numbers – Hacker Rank Solution

Separate the Numbers – Hacker Rank Solution

**Problem:**

The diagram below depicts some beautiful strings:

Perform queries where each query consists of some integer string . For each query, print whether or not the string is beautiful on a new line. If it is beautiful, print `YES x`

, where is the first number of the increasing sequence. If there are multiple such values of , choose the smallest. Otherwise, print `NO`

.

**Function Description**

Complete the *separateNumbers* function in the editor below.

separateNumbers has the following parameter:

*s*: an integer value represented as a string

**Prints**

– *string:* Print a string as described above. Return nothing.

**Input Format**

The first line contains an integer , the number of strings to evaluate.

Each of the next lines contains an integer string to query.

**Constraints**

**Sample Input 0**

7 1234 91011 99100 101103 010203 13 1

**Sample Output 0**

YES 1 YES 9 YES 99 NO NO NO NO

**Explanation 0**

The first three numbers are beautiful (see the diagram above). The remaining numbers are not beautiful:

- For , all possible splits violate the first and/or second conditions.
- For , it starts with a zero so all possible splits violate the second condition.
- For , the only possible split is , which violates the first condition.
- For , there are no possible splits because only has one digit.

**Sample Input 1**

4 99910001001 7891011 9899100 999100010001

**Sample Output 1**

YES 999 YES 7 YES 98 NO

`Separate the Numbers – Hacker Rank Solution`

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) { Scanner s = new Scanner(System.in); int q = s.nextInt(); for(int i = 0; i < q; i++){ String in = s.next(); long a = check(in); if (a != -1) { System.out.println("YES " + a); } else { System.out.println("NO"); } } } public static long check(String s) { for (int j = 1; j < s.length()+1 && j < 18; j++) { long a = Long.parseLong(s.substring(0, j)); long init = a; String temp = "" + a; int count = 1; while (temp.length() < s.length()) { a++; count++; temp += a; } if (temp.equals(s) && count >= 2) { return init; } } return -1; } }