Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Look and Say

Look and Say

Difficulty: 1200 2000 ms 128 MB

implementation strings

The look-and-say sequence starts 1, 11, 21, 1211, 111221, ...: each term describes the previous term's digit runs aloud. Print term N.

Input: one integer N.

Output: the N-th term.

Constraints:

  • 1 ≤ N ≤ 25

Sample Tests

Input 1
4
Output 1
1211
Input 2
1
Output 2
1

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen