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

Two Sum

solution.ts

Two Sum

easy⏱ 15 mintypescriptchallengesproblem-solving-basic-

Exampleinput → output

Input

4
2 7 11 15
9

Output

0 1

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

Given an array of integers and a target sum, find two numbers that add up to the target. Return the indices (0-based) of the two numbers.

Assume exactly one solution exists and you may not use the same element twice.

Example: nums=[2,7,11,15], target=9 → nums[0]+nums[1]=2+7=9 → Output: '0 1'

Input format Line 1: n (array size). Line 2: n space-separated integers. Line 3: target.

Output format Two space-separated indices (0-based, smaller first).

Constraints 2 ≤ n ≤ 10⁴, -10⁹ ≤ nums[i] ≤ 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

Two Sum

solution.ts

Two Sum

easy⏱ 15 mintypescriptchallengesproblem-solving-basic-

Exampleinput → output

Input

4
2 7 11 15
9

Output

0 1

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

Given an array of integers and a target sum, find two numbers that add up to the target. Return the indices (0-based) of the two numbers.

Assume exactly one solution exists and you may not use the same element twice.

Example: nums=[2,7,11,15], target=9 → nums[0]+nums[1]=2+7=9 → Output: '0 1'

Input format Line 1: n (array size). Line 2: n space-separated integers. Line 3: target.

Output format Two space-separated indices (0-based, smaller first).

Constraints 2 ≤ n ≤ 10⁴, -10⁹ ≤ nums[i] ≤ 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