Restock before opening

EasyArraysHash maps

Before opening, the brewery lays out one bag for each item on its packing list. The stock array lists the blend ID of each available bag, and orders lists one blend ID for every bag customers requested. A stock bag can cover only one matching order. Return an array with the same length and order as orders: put 0 when an unused matching bag is available, and 1 when a new bag must be roasted. Handle orders from left to right. A newly roasted bag goes directly to that order and is not added to stock.

Example 1

INPUT[4,4,9], [4,9,4,4]OUTPUT[0,0,0,1]

The first three orders use the two bags of blend 4 and one of blend 9. The last order needs a new bag.

Example 2

INPUT[], [2,2,0]OUTPUT[1,1,1]

No bags are stocked. Each order needs its own new bag, including the second order for blend 2.

Keep in mind

0 <= stock.length, orders.length <= 20,000
Each blend ID is an integer from 0 to 1,000,000.

/** @param {number[]} stock
 *  @param {number[]} orders
 *  @returns {number[]} */
function solve(stock, orders) {
  // Mark each order that needs a newly roasted bag.
}

/** @param {number[]} stock
 *  @param {number[]} orders
 *  @returns {number[]} */
function solve(stock, orders) {
  // Mark each order that needs a newly roasted bag.
}

INPUT[4,4,9], [4,9,4,4]

EXPECTED OUTPUT[0,0,0,1]

Public samples only. These checks do not award ranked points.

AFTER THE SOLVE

How the solution works.

Walk through a solution, check its time and space costs, and compare it with yours.

Checking your progress…

Restock before opening

Example 1

Example 2

Keep in mind

How the solution works.

Related problems

The first solo ticket

A ledger worth checking