Merge overlapping intervals in C#

C# interview exercise on Collections & LINQ, difficulty 3 of 3. Solve it in the editor beside a worked example; the tests run the moment you do.

Write MergeIntervals(intervals) that merges every overlapping or touching (Start, End) tuple and returns them sorted by Start. Do not change the input list.

Each exercise pairs a worked example with a twin problem to solve in a real editor; the tests run the moment you do. Progress is saved in your browser, and in your account if you sign in.

More Collections & LINQ in C#

• Filter and transform with LINQ
• Unique, ascending
• Chunk into groups
• Flatten deeply with pattern matching
• Rotate right by k
• Transpose a jagged array
• Max sum of k consecutive

All C# exercises · Other languages and frameworks