GoodSpace Fullstack Developer interview questions

Imagine you have a schedule of tasks represented by intervals where each interval is defined by its start time and end time. Your goal is to optimize the schedule by combining overlapping intervals. Given a list of intervals in the format [start_time, end_time], create an algorithm to consolidate these intervals into a new set of non-overlapping intervals, ensuring that all tasks are accounted for in the optimized schedule.