Type Here to Get Search Results !

Day 6: HackerRank 30 Days Of Code Solution By CodingHumans | Let's Review |

0

Day 6: Let's Review

Problem

Given a string, SS, of length NN that is indexed from 00 to N−1N−1, print its even-indexed and odd-indexed characters as 22 space-separated strings on a single line (see the Sample below for more detail).

Note: 00 is considered to be an even index.

Input Format

The first line contains an integer, TT (the number of test cases).

Each line ii of the TT subsequent lines contain a String, SS.

Constraints

1≤T≤101≤T≤10

2≤length of S≤100002≤length of S≤10000

Output Format


For each String SjSj (where 0≤j≤T−10≤j≤T−1), print SjSj‘s even-indexed characters, followed by a space, followed by SjSj‘s odd-indexed characters.


Sample Input

2

Hacker

Rank

Sample Output

Hce akr

Rn ak

Explanation

Test Case 0: S=“Hacker”

S[0]=“H”

S[1]=“a”

S[2]=“c”

S[3]=“k”

S[4]=“e”

S[5]=“r”

The even indices are 0, 2, and 4, and the odd indices are 1, 3, and 5. We then print a single line of 2 space-separated strings; the first string contains the ordered characters from S‘s even indices (Hce), and the second string contains the ordered characters from S‘s odd indices (akr).

Test Case 1: S=“Rank”

S[0]=“R”

S[1]=“a”

S[2]=“n”

S[3]=“k”

The even indices are 0 and 2, and the odd indices are 1 and 3. We then print a single line of 2 space-separated strings; the first string contains the ordered characters from S‘s even indices (Rn), and the second string contains the ordered characters from S‘s odd indices (ak).









Recommended: Please try your approach on your integrated development environment (IDE) first, before moving on to the solution.

Few words from CodingHumans : Don't Just copy paste the solution, try to analyze the problem and solve it without looking by taking the the solution as a hint or a reference . Your understanding of the solution matters.

HAVE A GOOD DAY 😁









Solution:
( 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)
    {
        Scanner in = new Scanner(System.in);
        int N = in.nextInt();
        in.nextLine();
        for (int i = 0; i < N; i++)
        {
            String string = in.nextLine();
            char[] charArray = string.toCharArray();
            for (int j = 0; j < charArray.length; j++)
            {
                if (j % 2 == 0)
                {

                    System.out.print(charArray[j]);

                }
            }
            System.out.print(" ");
            for (int j = 0; j < charArray.length; j++)

            {

                if (j % 2 != 0)

                {

                    System.out.print(charArray[j]);

                }

            }
            System.out.println();

        }
        in.close();

    }
}





Post a Comment

0 Comments

Top Post Ad

Below Post Ad