Optimus Agency | Professional Web Development

🧠

Name things for the reader, not the writer.

Tips & tricks

Open the command palette to jump anywhere
Browse blogs and courses by track
Try the live code playground

🧠

Name things for the reader, not the writer.

Tips & tricks

Open the command palette to jump anywhere
Browse blogs and courses by track
Try the live code playground

Language

Runs in the browser · readline() reads stdin

Explorer

Merge Intervals

solution.ts

Merge Intervals

medium⏱ 15 mintypescriptchallengesproblem-solving-intermediate-

Exampleinput → output

Input

Output

1 6
8 10
15 18

Sample case — your program reads stdin and prints to stdout.

Given an array of intervals where intervals[i] = [start, end], merge all overlapping intervals and return non-overlapping intervals.

Algorithm: Sort by start time, then iterate and merge if current start ≤ previous end.

Example: [[1,3],[2,6],[8,10],[15,18]] → [[1,6],[8,10],[15,18]] (intervals [1,3] and [2,6] overlap)

Input format Line 1: n (number of intervals). Next n lines: start end (space-separated).

Output format Merged intervals, one per line as 'start end'.

Constraints 1 ≤ n ≤ 10⁴, 0 ≤ start ≤ end ≤ 10⁴

Every problem you solve becomes a story you can tell in an interview.

Solving under pressure trains the muscle that's most tested in onsite rounds.
Explaining your approach out loud matters more than reaching the optimal solution.
Consistency wins: 1 challenge daily > 10 challenges on one Saturday a month.

Pro tip:After solving, write 2 lines on what you learned — that's what you'll remember in the interview.

mainIdle

solution.ts

🧠

Name things for the reader, not the writer.

Tips & tricks

Open the command palette to jump anywhere
Browse blogs and courses by track
Try the live code playground

Language

Runs in the browser · readline() reads stdin

Explorer

Merge Intervals

solution.ts

Merge Intervals

medium⏱ 15 mintypescriptchallengesproblem-solving-intermediate-

Exampleinput → output

Input

Output

1 6
8 10
15 18

Sample case — your program reads stdin and prints to stdout.

Given an array of intervals where intervals[i] = [start, end], merge all overlapping intervals and return non-overlapping intervals.

Algorithm: Sort by start time, then iterate and merge if current start ≤ previous end.

Example: [[1,3],[2,6],[8,10],[15,18]] → [[1,6],[8,10],[15,18]] (intervals [1,3] and [2,6] overlap)

Input format Line 1: n (number of intervals). Next n lines: start end (space-separated).

Output format Merged intervals, one per line as 'start end'.

Constraints 1 ≤ n ≤ 10⁴, 0 ≤ start ≤ end ≤ 10⁴

Every problem you solve becomes a story you can tell in an interview.

Solving under pressure trains the muscle that's most tested in onsite rounds.
Explaining your approach out loud matters more than reaching the optimal solution.
Consistency wins: 1 challenge daily > 10 challenges on one Saturday a month.

Pro tip:After solving, write 2 lines on what you learned — that's what you'll remember in the interview.

mainIdle

solution.ts

Optimus Agency | Professional Web Development