Use a greedy approach to find overlapping intervals by comparing the end of the current interval with the start of the next one.

Initialize the arrow position at the end of the first interval and iterate through the sorted intervals, updating the arrow position only when the next interval starts after the current arrow position.

For each interval that starts after the current arrow position, increment the arrow count and set the new arrow position to the end of the current interval.