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

Related Articles

  1. Algorithm Interview: Subarray With Target Sum
  2. Daily Interview Problem: Min Range Needed to Sort
  3. 56 Bytes
  4. Algorithm Interview: Make the Largest Number
  5. Daily Interview Problem: Largest BST in a Binary Tree
  6. Algorithm Interview: Permutations of numbers
  7. Daily Interview Problem: Group Words that are Anagrams
  8. Plus One
  9. Daily Interview Problem: Product of Array Except Self
  10. Maximum In A Stack

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