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

Related Articles

  1. [Daily Problem] Course Prerequisites
  2. First and Last Indices of an Element in a Sorted Array
  3. Batch Programming in XP
  4. Daily Interview Question: Edit Distance
  5. Sorting a list with 3 unique numbers
  6. Making a Height Balanced Binary Search Tree
  7. Algorithm Interview: Determine If Linked List is Palindrome
  8. Daily Interview Problem: Reconstrunct Binary Tree from Preorder and Inorder Traversals
  9. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  10. Absolute Path

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