Back to problems

Solve interval, grid-fill, and heap tasks

Algorithm · Apple · Hard

Your assignment is to implement solutions for the algorithmic challenges listed below. Problem 1 — Determine the maximum number of concurrent users given a collection of online time intervals. Problem 2 — Fill a grid with vegetables so that every vegetable type forms a single connected region. Problem 3 — Design a data structure that can efficiently retrieve both the minimum and maximum values. Examples Example

Checking your access…