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

Related Articles

  1. Generate All IP Addresses
  2. Top K Frequent words
  3. Binary Tree Level with Minimum Sum
  4. Daily Interview Puzzle: Falling Dominoes
  5. Algorithm Interview: Smallest Number that is not a Sum of a Subset of List
  6. Invert a Binary Tree
  7. Absolute Path
  8. Daily Interview Puzzle: Minimum Size Subarray Sum
  9. PHP Unit Tests on VPS Server
  10. [Daily Problem] Angles of a Clock

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