Maximum Number of Overlapping Intervals

You are given an array of intervals arr[][], where each interval is represented by two integers [start, end] (inclusive). Return the maximum number of intervals that overlap at any point in time. Two intervals overlap if they share at least one common point on the real line; touching intervals such as [1,2] and [2,3] are NOT considered overlapping unless the problem explicitly states otherwise.