**Task**

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

**Input Format**

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

Each line ii of the T subsequent lines contain a String, S.

**Constraints**

- 1 ≤ T ≤10
- 2 ≤ length of S ≤10000

**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).

**My solution: **

So I had a hard time with this challenge because I misunderstood the problem. I thought the T and S arguments were independent of each other. However, they are not. The value of S is dependent on the value of T. So for each test case (T), there is one substring (S). Thus, the trick is to use T to prompt the number of user inputs for S, and then store the value of S in an array.

Took me an entire day and 1 Kevin Liu to figure all of this out.

Original problem here.