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

Related Articles

  1. Daily Interview Problem: Contiguous Subarray with Maximum Sum
  2. Daily Interview Problem: Queue Using Two Stacks
  3. Daily Interview Problem: Maximum Profit From Stocks
  4. Daily Interview Problem: Given two arrays, write a function to compute their intersection.
  5. Spreadsheet Columns
  6. Fix Brackets
  7. Most Frequent Subtree Sum
  8. Compare Version Numbers
  9. Algorithm Interview: Maximum Path Sum in Binary Tree
  10. A trick for getting good at coding interviews FASTER

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