To the Top
File:  root - text - article - 2020 - 02 - multitasking.txt
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Category: Computing | 920 Views, 22183 Search Bots | 77 Words

Subscribe to Feed Burner | Browse | Archive
Hi, here's your problem today. This problem was recently asked by AirBNB:

We have a list of tasks to perform, with a cooldown period. We can do multiple of these at the same time, but we cannot run the same task simultaneously.

Given a list of tasks, find how long it will take to complete the tasks in the order they are input.
tasks = [1, 1, 2, 1]
cooldown = 2
output: 7 (order is 1 _ _ 1 2 _ 1)
def findTime(arr, cooldown):
# Fill this in.

print findTime([1, 1, 2, 1], 2)
# 7
Tags: 每日算法题, 算法, 数据结构, 面试题, Daily Interview Problem, Data Structures and Algorithms, Computer Programming, Python, | English | Home Page | Cateogry: Computing | 920 Views, 22183 Search Bots | 77 Words Subscribe to Feed Burner

Related Articles

  1. Patterns for breaking down questions you haven
  2. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  3. Daily Interview Puzzle: Minimum Size Subarray Sum
  4. Batch Programming in XP
  5. Longest Substring Without Repeating Characters
  6. Daily Interview Problem: Word Ordering in a Different Alphabetical Order
  7. Daily Interview Problem: Merge K Sorted Linked Lists
  8. A trick for getting good at coding interviews FASTER
  9. Find the non-duplicate number
  10. [Daily Problem] Longest Increasing Subsequence

Comments (0)

Your Email (Domain Part Not Exposed):

Your Comments:

Privately By Mail Colors More Smileys S x y @

Verification (Click Image 2 Refresh):

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