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

Flatland Space Stations

solution.ts

Flatland Space Stations

easy⏱ 15 mintypescriptchallengesproblem-solving-intermediate-

Exampleinput → output

Input

5 2
0 4

Output

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

Flatland has n cities in a line (0 to n-1). Some cities have space stations. Find the maximum distance from any city to its nearest space station.

Example: n=5, stations at [0,4]. City 0: distance 0, City 1: min(1,3)=1, City 2: min(2,2)=2, City 3: min(3,1)=1, City 4: distance 0. Maximum is 2.

Input format First line: n m (space-separated, m is number of stations). Second line: m space-separated integers (city indices with stations).

Output format A single integer: the maximum distance to nearest space station.

Constraints 1 ≤ n ≤ 10⁵, 1 ≤ m ≤ n

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

Flatland Space Stations

solution.ts

Flatland Space Stations

easy⏱ 15 mintypescriptchallengesproblem-solving-intermediate-

Exampleinput → output

Input

5 2
0 4

Output

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

Flatland has n cities in a line (0 to n-1). Some cities have space stations. Find the maximum distance from any city to its nearest space station.

Example: n=5, stations at [0,4]. City 0: distance 0, City 1: min(1,3)=1, City 2: min(2,2)=2, City 3: min(3,1)=1, City 4: distance 0. Maximum is 2.

Input format First line: n m (space-separated, m is number of stations). Second line: m space-separated integers (city indices with stations).

Output format A single integer: the maximum distance to nearest space station.

Constraints 1 ≤ n ≤ 10⁵, 1 ≤ m ≤ n

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