To the Top
File:  root - text - article - 2019 - 11 - look-and-say-sequence.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 314 Views, 14186 Search Bots | 77 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by Google:

A look-and-say sequence is defined as the integer sequence beginning with a single digit in which the next term is obtained by describing the previous term. An example is easier to understand:

Each consecutive value describes the prior value.


1 #
11 # one 1's
21 # two 1's
1211 # one 2, and one 1.
111221 # #one 1, one 2, and two 1's.


Your task is, return the nth term of this sequence.
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 314 Views, 14186 Search Bots | 77 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Find the k-th Largest Element in a List
  2. Daily Interview Problem: Queue Using Two Stacks
  3. Daily Interview Puzzle: Falling Dominoes
  4. Daily Interview Question: Create a Simple Calculator
  5. Daily Interview Problem: Merge Overlapping Intervals
  6. Algorithm Interview: Shifted String
  7. Algorithm Interview: No Adjacent Repeating Characters
  8. Non-decreasing Array with Single Modification
  9. [Daily Problem] Longest Increasing Subsequence
  10. Daily Interview Question: Edit Distance

Comments (0)

    Be the first one to comment this page !


Page Edited: May 11 2024 14:36:49 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="index, follow">