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

Related Articles

  1. Daily Interview Problem: Merge Overlapping Intervals
  2. Patterns for breaking down questions you haven
  3. [Daily Problem] Move Zeros
  4. Generate All IP Addresses
  5. Daily Interview Puzzle: Minimum Size Subarray Sum
  6. New Vulnerabilities (CVE-2016-4581) have been detected in CentOS/RHEL/CloudLinux 7
  7. Detect Linked List Cycle
  8. Progess made
  9. Skip the readings, focus on problems. And use all the hints!
  10. CPU Utilization

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