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

Related Articles

  1. Algorithm Interview: Make the Largest Number
  2. Daily Interview Problem: Buddy Strings
  3. Daily Interview Problem: Jump to the End
  4. CVE-2015-8874 - cPanel EasyApache Vulnerabilities
  5. Floor and Ceiling of a Binary Search Tree
  6. Multitasking
  7. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  8. Algorithm Interview Question: H-Index
  9. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  10. Daily Interview Question: Word Search

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" />