Algorithm · Weride · Hard
A founder is raising capital and wants to line up as many investor meetings as possible. Each investor can only meet during a specific window of consecutive days, and the founder can hold at most one meeting on any given day. You are given the investors' availability through two integer arrays of equal length: firstDay[i] marks the earliest day investor i is free. lastDay[i] marks the latest day investor i is free (the window is inclusive). Determine the greatest number of…
Checking your access…