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

Related Articles

  1. Reverse a Directed Graph
  2. Daily Interview Puzzle: Ways to Traverse a Grid
  3. Daily Interview Problem: Reverse Words in a String
  4. Algorithm Interview: Maximum Path Sum in Binary Tree
  5. Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
  6. Absolute Path
  7. Daily Interview Problem: Largest BST in a Binary Tree
  8. Batch Programming in XP
  9. Number of Ways to Climb Stairs
  10. Daily Interview Problem: Merge Overlapping Intervals

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