Look-And-Say Sequence

Easy

0/40

Average time to solve is 15m

Contributed by

97 upvotes

Asked in companies

Problem statement

The Look-And-Say sequence is a sequence of positive integers. The sequence is as follows:

1, 11, 21, 1211, 111221, 312211, 13112221,...

This sequence is constructed in the following way:

The first number is 1.

This is read as “One 1”. 
Hence, the second number will be 11.

The second number is read as “Two 1s”. 
Hence, the third number will be 21.

The third number is read as “One 2, One 1”. 
Hence, the fourth number will be 1211. And so on.

The fourth term is read as “One 1, One 2, Two 1s”.

Hence, the fifth term will be 111221. And so on.

Given an integer N, find the Nth term of the sequence.

Detailed explanation ( Input/output format, Notes, Images )

Input Format:

The first line of input contains a single integer 'T', representing the number of test cases or queries to be run. 
Then the test cases follow.

For each test case, the only line contains a single integer 'N'.

Output Format:

For each test case/query, print a single containing a single string denoting the Nth term of the sequence.

The output for every test case will be printed in a separate line.

Note:

You do not need to print anything, the output has already been taken care of. Just implement the function.

Constraints:

1 <= T <= 30
1 <= N <= 40

Where 'T' is the number of test cases and 'N' is the given sequence index.

Time Limit: 1 sec

Sample Input 1:

Sample Output 1:

1
11
21

Explanation for Sample 1:

The first term is 1.

The second term is 11.

The third term is 21.

Sample Input 2:

1
6

Sample Output 2:

Console