Interval Problem Requiring Sorting by Start (or End)

Problem: Interval Processing (Sort by Start or End) You are given an array of intervals intervals, where each interval is represented as [start, end] (integers with start <= end). Process these intervals and output the processed interval list (or the required numeric result). Your solution should rely on the key step of sorting intervals by start (or by end). Note: The interview note only mentioned “sort by start/end” and getting stuck on a key step, but it doesn’t specify whether the exact task was merge intervals, erase overlaps, or meeting rooms, so a single precise statement cannot be reconstructed.