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 | 365 Views, 15498 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 | 365 Views, 15498 Search Bots | 77 Words Subscribe to Feed Burner

Related Articles

  1. Spreadsheet Column Title
  2. Longest Substring Without Repeating Characters
  3. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  4. Daily Interview Problem: Merge Overlapping Intervals
  5. Algorithm Interview Question: H-Index
  6. Daily Interview Problem: Queue Using Two Stacks
  7. Algorithm Interview: Subarray With Target Sum
  8. Daily Interview Puzzle: Ways to Traverse a Grid
  9. Daily Interview Problem: Minimum Removals for Valid Parenthesis
  10. Daily Interview Problem: Find the k-th Largest Element in a List

Comments (0)

Your Email (Domain Part Not Exposed):

Your Comments:

Privately By Mail Colors More Smileys S x y @

Verification (Click Image 2 Refresh):

    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="noindex, follow" />