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

Related Articles

  1. Invert a Binary Tree
  2. Sorting a list with 3 unique numbers
  3. Daily Interview Puzzle: Intersection of Linked Lists
  4. Daily Interview Problem: Largest Product of 3 Elements I
  5. Daily Interview Question: Create a Simple Calculator
  6. Daily Interview Problem:Create a balanced binary search tree
  7. Algorithm Interview Question: Nth Fibonacci Number
  8. Skip the readings, focus on problems. And use all the hints!
  9. Daily Interview Problem: Maximum Profit From Stocks
  10. Daily Interview Problem: Decode String

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="noindex, follow" />