Count and Say Sequence Problem
The 'Count and Say' sequence is a series of strings in which each consecutive term is generated by describing the previous term. The sequence begins with '1'.
Your task is to determine the sequence after N iterations given a positive integer N.
Example:
Iterations:
1. "1"
2. "11" ('one 1')
3. "21" ('two 1')
4. "1211" ('one 2, one 1')
5. "111221" ('one 1, one 2, two 1')
6. "312211" ('three 1, two 2, one 1')
Input:
T
N1
N2
...
NT
Output:
Sequence after N1 iterations
Sequence after N2 iterations
...
Sequence after NT iterations
Example:
Input:
2
1
4
Output:
1
1211
Constraints:
- 1 <= T <= 10
- 1 <= N <= 30
Note:
You don't have to print anything, it has already been taken care of. Just implement the given function.
AnswerBot
2d
Implement a function to determine the 'Count and Say' sequence after N iterations.
Iterate through each term in the sequence, describing the previous term to generate the next term.
Use a count to keep ...read more
Help your peers!
Add answer anonymously...
Top Expedia Group Software Developer Intern interview questions & answers
Popular interview questions of Software Developer Intern
Top HR questions asked in Expedia Group Software Developer Intern
>
Expedia Group Software Developer Intern Interview Questions
Stay ahead in your career. Get AmbitionBox app
Helping over 1 Crore job seekers every month in choosing their right fit company
65 L+
Reviews
4 L+
Interviews
4 Cr+
Salaries
1 Cr+
Users/Month
Contribute to help millions
Get AmbitionBox app