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, 17298 Search Bots | 43 Words
| Browse | Archive
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 422 Views, 17298 Search Bots | 43 Words
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
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, 17298 Search Bots | 43 Words 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.
![Subscribe to Feed Burner Subscribe to Feed Burner](/images/form/rss.gif)
Related Articles
- Find Missing Numbers in an Array
- Daily Interview Problem: Group Words that are Anagrams
- Daily Interview Problem: Given two arrays, write a function to compute their intersection.
- Daily Interview Problem: Longest Substring With K Distinct Characters
- Daily Interview Problem: Count Number of Unival Subtrees
- Daily Interview Problem: Get all Values at a Certain Height in a Binary Tree
- Algorithm Interview: Permutations of numbers
- Daily Interview Problem: Validate Binary Search Tree
- PHP Unit Tests on VPS Server
- Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
©2006~2024 SteakOverCooked - 0.01345 Seconds(s) - 1332.692 KB/s - 38 Online
Memory: 492.73 KB
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
How to Cook a Perfect Steak? | <meta name="robots" content="noindex, follow" />
![](/images/top.jpg)
18:54:01 up 13 days, 18:33, 2 users, load average: 0.98, 0.86, 0.73 - Server PHP Version: 7.4.33
Read & Write - Normal - Mini - Post - All Comments - Statistics
Be the first one to comment this page !