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

Modified Kaprekar Numbers

solution.ts

Modified Kaprekar Numbers

easy⏱ 15 mintypescriptchallengesproblem-solving-basic-

Exampleinput → output

Input

1
100

Output

1 9 45 55 99

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

A modified Kaprekar number n satisfies: square n, split the square into left part l and right part r (where r has exactly d digits, d = number of digits in n), then l + r = n. Find all such numbers in range [p, q].

Example: n=45 → square=2025 → split: l=20, r=25 (r has 2 digits, same as n) → 20+25=45 ✓. If no numbers found, output 'INVALID RANGE'.

Input format Two integers p and q (p ≤ q), one per line.

Output format Print all modified Kaprekar numbers in the range, space-separated, or 'INVALID RANGE' if none exist.

Constraints 0 < p < q < 100000

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

Modified Kaprekar Numbers

solution.ts

Modified Kaprekar Numbers

easy⏱ 15 mintypescriptchallengesproblem-solving-basic-

Exampleinput → output

Input

1
100

Output

1 9 45 55 99

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

Example: n=45 → square=2025 → split: l=20, r=25 (r has 2 digits, same as n) → 20+25=45 ✓. If no numbers found, output 'INVALID RANGE'.

Input format Two integers p and q (p ≤ q), one per line.

Output format Print all modified Kaprekar numbers in the range, space-separated, or 'INVALID RANGE' if none exist.

Constraints 0 < p < q < 100000

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