 New update is available. Click here to update. Close
Topic list
Look-And-Say Sequence
EASY
15 mins 17 upvotes
Other topics
Problem solved
Skill meter Strings
-
- Matrices (2D Arrays)
-
- -
- Sorting
-
- Binary Search
-
- Stacks & Queues
-
- Trees
-
- Graph
-
- Dynamic Programming
-
- Greedy
-
- Tries
-
- Arrays
-
- SQL
-
- Binary Search Trees
-
- Heap
-
- Bit Manipulation
-
-
Solve problems & track your progress
Checkout your overall progress in every topic here
Become Sensei
in DSA topics
Open the topic and solve more problems associated with it to improve your skills
Check out the skill meter for every topic
See how many problems you are left with to solve for cracking any stage. Score more than zero to get your progress counted.

# Look-And-Say Sequence

Easy 0/40
Avg time to solve 15 mins
Success Rate 85 % Share 17 upvotes

## Problem Statement

#### 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, Constraints, Images ) ##### Sample Input 1:
``````3
1
2
3
``````
##### 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:
``````312211
``````  Auto Console