The editorial for 'Merge Intervals' needs improvement
The current editorial for the Merge Intervals problem jumps straight to the optimal solution without explaining the intuition behind sorting by start time first.
For beginners, it would help to:
- Show the brute force approach first
- Explain WHY sorting helps
- Walk through a visual example
I can contribute an improved version if there's a way to submit editorial changes.