All challenges
Easy 0 solved 0% acceptance

Countdown Until Matching Digits

Count down from a two-digit number until both digits are the same.

What you'll learn

  • Get the tens and ones digits with division and remainder
  • Loop until a condition becomes true
  • Include both the start and the stop value

Problem

A game show clock counts down from a two-digit number and stops as soon as both of its digits match, like 77 or 33. Starting from n, list every number the clock shows, including n itself and the matching number it stops on. If n already has matching digits, the clock shows only n.

Implement countdown_matching_digits(n).

Input

n: The starting number. It is valid from 11 to 99.

Output

Return the numbers from n down to the first number with two equal digits, in the order the clock shows them. If n is outside 11 to 99, return an empty list.

Constraints

−1000 ≤ n ≤ 1000

Examples

Example 1
Input:
n = 93

Expected output:
expected = [93, 92, 91, 90, 89, 88]
Input:
long long n = 93;

Expected output:
std::vector<long long> expected = {93, 92, 91, 90, 89, 88};
Input:
long n = 93;

Expected output:
long[] expected = new long[] {93, 92, 91, 90, 89, 88};

Explanation

The clock goes 93, 92, 91, 90, 89, 88 and stops at 88 because its digits match.

Example 2
Input:
n = 105

Expected output:
expected = []
Input:
long long n = 105;

Expected output:
std::vector<long long> expected = {};
Input:
long n = 105;

Expected output:
long[] expected = new long[] {};

Explanation

105 is not a two-digit number from 11 to 99, so the answer is [].

How to approach it

Try on your own first, then open one hint at a time.

Hint 1

The tens digit is n / 10 and the ones digit is n % 10 with integer division.

Hint 2

Add the current number to the result before checking whether to stop.

Hint 3

Reject numbers outside 11 to 99 before the loop starts.

Expected complexity

O(1) time, O(1) extra space

References

This challenge is adapted for CodeUtility. Follow the statement and constraints above.

The best passing solution of each coder. Faster, smaller and better-reviewed solutions rank higher.

No passing solutions yet. Solve it to take first place.

Learn from others

Community solutions

No published solutions yet. Solve this challenge to share the first one.