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

Move Zeroes to End

solution.ts

Move Zeroes to End

easy⏱ 15 mintypescriptchallengesproblem-solving-basic-

Exampleinput → output

Input

5
0 1 0 3 12

Output

1 3 12 0 0

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

Given an array of integers, move all zeroes to the end while maintaining the relative order of non-zero elements.

Use two pointers: one for the position to insert non-zero, one to scan.

Example: [0,1,0,3,12] → [1,3,12,0,0]

Input format Line 1: n. Line 2: n space-separated integers.

Output format The array with zeroes moved to end, space-separated.

Constraints 1 ≤ n ≤ 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

Move Zeroes to End

solution.ts

Move Zeroes to End

easy⏱ 15 mintypescriptchallengesproblem-solving-basic-

Exampleinput → output

Input

5
0 1 0 3 12

Output

1 3 12 0 0

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

Given an array of integers, move all zeroes to the end while maintaining the relative order of non-zero elements.

Use two pointers: one for the position to insert non-zero, one to scan.

Example: [0,1,0,3,12] → [1,3,12,0,0]

Input format Line 1: n. Line 2: n space-separated integers.

Output format The array with zeroes moved to end, space-separated.

Constraints 1 ≤ n ≤ 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