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 | 1193 Views, 25112 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 | 1193 Views, 25112 Search Bots | 77 Words Subscribe to Feed Burner

Related Articles

  1. Daily Interview Problem: Largest BST in a Binary Tree
  2. Daily Interview Problem: Running Median
  3. Daily Interview Problem: Deepest Node in a Binary Tree
  4. Daily Interview Problem: Min Range Needed to Sort
  5. Plus One
  6. Longest Substring Without Repeating Characters
  7. Daily Interview Problem: Full Binary Tree
  8. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  9. How to Play WAV music under DOS?
  10. Generate All IP Addresses

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