To the Top
File:  root - text - article - 2020 - 02 - consecutive-ones.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 401 Views, 19458 Search Bots | 52 Words

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

Return the longest run of 1s for a given integer n's binary representation.

Example:
Input: 242
Output: 4
242 in binary is 0b11110010, so the longest run of 1 is 4.


def longest_run(n):
# Fill this in.

print longest_run(242)
# 4
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 401 Views, 19458 Search Bots | 52 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Largest BST in a Binary Tree
  2. Algorithm Interview Question: Nth Fibonacci Number
  3. Absolute Path
  4. Daily Interview Problem: Reverse Integer
  5. Daily Interview Problem: Find the Number of Islands
  6. Spreadsheet Columns
  7. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  8. Daily Interview Problem: Word Ordering in a Different Alphabetical Order
  9. Daily Interview Problem: Room scheduling
  10. [Daily Problem] Remove Consecutive Nodes that Sum to 0

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