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

Related Articles

  1. Algorithm Interview Question: Symmetric k-ary Tree
  2. [Daily Problem] Remove Consecutive Nodes that Sum to 0
  3. Print a tree level-by-level, with line-breaks
  4. Daily Interview Problem: Reverse Words in a String
  5. Algorithm Interview Question: Max and Min with Limited Comparisons
  6. Linode Support Ticket 10029540 - Other - Important Notice Regarding Ubuntu 17.10 Image
  7. ImageMagick Vulnerabilities -  CVE-2016–3714
  8. Daily Interview Problem: Largest BST in a Binary Tree
  9. Number of Ways to Climb Stairs
  10. Compare Version Numbers

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