Available question text
Count how many integers in [1, N] consist only of digits {0,1,6,8,9} and whose 180° rotation (mapping 0→0,1→1,6↔9,8→8) produces a different valid number. The common approach is to generate candidates via DFS/backtracking (pruning by N) and check that the rotated value is not equal to the original.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1088. Confusing Number II
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source