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

Related Articles

  1. Daily Interview Problem: First Missing Positive Integer
  2. Daily Interview Problem: Full Binary Tree
  3. A trick for getting good at coding interviews FASTER
  4. Daily Interview Problem: Jump to the End
  5. Daily Interview Problem: Count Number of Unival Subtrees
  6. Batch Programming in XP
  7. Daily Interview Problem: Tree Serialization
  8. Daily Interview Problem: Product of Array Except Self
  9. Delphi Dynamic Array
  10. Daily Interview Problem: Min Stack

Comments (0)

Read & Write - Normal - Mini - Post - All Comments - Statistics

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