Single-Threaded CPU at DoorDash

Medium47.3% acceptance

This problem has 75.0% frequency at DoorDash.

Problem Description

You are given `n` tasks labeled from `0` to `n - 1` represented by a 2D integer array `tasks`, where `tasks[i] = [enqueueTimei, processingTimei]` means that the `ith` task will be available to process at `enqueueTimei` and will take `processingTimei` to finish processing. You have a...

Read full problem and hints

Topics

Array Sorting Heap (Priority Queue)

Also asked at 6 companies

Amazon Goldman Sachs Google IBM Meta Microsoft

View Full Problem

Problem Description

Topics

Also asked at 6 companies

More DoorDash Questions