Maximum Interval Overlap Count

You are provided with an array of closed intervals along the number line. Each interval is expressed as a two-element array [start, end], and it covers every point from start to end inclusive. Two intervals are said to overlap at a point if that specific point belongs to both of them. Your task is to find the largest possible count of intervals that overlap at any single point on the number line. Constraints 1 Input: intervals = [[1, 3], [2, 5], [4, 6]] Output: 2…