</> MAANG.io
coding interview ยท 101

Foundations

Master coding interviews with comprehensive coverage of data structures, algorithms, and problem-solving techniques. Progress from fundamentals to advanced topics with expertly curated content.

0/255 solved 0% complete

Strobogrammatic Number II

Core idea: A strobogrammatic number is symmetric under a 180ยฐ rotation, so build it from the outside in โ€” wrap a valid rotatable pair around a smaller strobogrammatic number, and only forbid the leading-0 pair at the outermost layer.


Problem, rephrased

You design glowing upside-down room numbers for a boutique hotel. A number is valid only if a guest who reads it while standing on their head sees a real number too. On the seven-segment style display, the only digits that survive a 180ยฐ flip are:

Digit Becomes when flipped
0 0
1 1
8 8
6 9
9 6

Every other digit (2,3,4,5,7) turns into nonsense, so it can never appear.

A whole number reads the same upside down when each digit at position i is the flip-partner of the digit at the mirror position. For example 69 flips to 69 (the 6 becomes a 9 on the right, the 9 becomes a 6 on the left), and 818 flips to 818.

Task: Given a length n, return all such numbers that have exactly n digits. Order does not matter.

Input n Output (a set of strings)
1 ["0", "1", "8"]
2 ["11", "69", "88", "96"]
3 ["101","609","808","906","111","619","818","916","181","689","888","986"]

We return strings, not integers, because leading zeros matter to the shape but a number like 0110 is not a valid 4-digit number โ€” more on that below.


Sign in to continue reading

The rest of this lesson is available with a free account. Signing in with Google or Microsoft is free.

Sign in to read the full lesson

Sign in to MAANG.io

Use your Google or Microsoft account โ€” no password to remember.

Continue with Google Continue with Microsoft

Please accept the terms above to continue.