Problem Statement

Largest Subset Problem Description In a scheduling system, there are n events represented by two arrays, start and finish , both of size n . The i th event begins at start[i] and ends at finish[i] (where 0 ≤ i A subset of these events is considered high-priority if at least one event within it overlaps or intersects with every other event in the subset. Determine the maximum size of a high-priority subset of events. Notes Events that overlap at their start or end times are considered to intersect. There may be multiple events with the same start and end times. Examples Example 1 Input: n = 4, start = [1, 2, 3, 4], finish = [2, 3, 5, 5] Output: 3 Explanation: The largest high-priority subset is {[2, 3], [3, 5], [4, 5]} where event [3, 5] intersects the remaining events in the subset. Therefore, the largest size of such a subset is 3. Example 2 Input: n = 5, start = [1, 3, 4, 6, 9], finish = [2, 8, 5, 7, 10] Output: 3 Explanation: The largest high-priority subset is {[3, 8], [4, 5], [