Algorithm · Google · Medium
Party Chair Planning Medium · Topics · Company Tags · Hints You are hosting a party and have invited n guests. Each guest i (0 <= i < n) arrives exactly at time S[i] and departs exactly at time E[i]. A chair is required for each guest from the moment they arrive until the moment they leave. At any point in time, every guest present must have a chair to sit on. Chairs can be reused immediately after a guest vacates them. Given two integer arrays S and E of length n, your task…
Checking your access…