To the Top
File:  root - text - article - 2019 - 12 - room-scheduling.txt.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 355 Views, 15592 Search Bots | 43 Words

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

You are given an array of tuples (start, end) representing time intervals for lectures. The intervals may be overlapping. Return the number of rooms that are required.

For example. [(30, 75), (0, 50), (60, 150)] should return 2.
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 355 Views, 15592 Search Bots | 43 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Maximum Profit From Stocks
  2. Fix Brackets
  3. A trick for getting good at coding interviews FASTER
  4. Reverse a Directed Graph
  5. Batch Programming in XP
  6. Daily Interview Problem: Merge K Sorted Linked Lists
  7. Daily Interview Problem: Merge Overlapping Intervals
  8. Algorithm Interview: String Compression
  9. Daily Interview Puzzle: Minimum Size Subarray Sum
  10. Daily Interview Problem: Merge List Of Number Into Ranges

Comments (0)

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