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 | 366 Views, 18320 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 | 366 Views, 18320 Search Bots | 52 Words Subscribe to Feed Burner

Related Articles

  1. Algorithm Interview: Maximum Path Sum in Binary Tree
  2. Floor and Ceiling of a Binary Search Tree
  3. Daily Interview Problem: Distribute Bonuses
  4. [Daily Problem] Validate Balanced Parentheses
  5. Daily Interview Problem: Count Number of Unival Subtrees
  6. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  7. Compare Version Numbers
  8. Sort a Partially Sorted List
  9. PHP Unit Tests on VPS Server
  10. Daily Interview Problem: Look and Say Sequence

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: October 30 2020 14:21:09 | RSS Subscription
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />