Rotated Digits: coding question

Available question text

Count how many integers in [1, n] consist only of rotatable digits (0,1,8,2,5,6,9) and contain at least one digit that changes when rotated (2,5,6,9). This is a per-digit counting/digit-DP problem: treat each position independently and count numbers ≤ n that avoid invalid digits (3,4,7) while excluding those made only of self-mapping digits (0,1,8).

Continue with questions that share topics or the same question type.

Add Digits
Coding
Check if Array Is Sorted and Rotated
Coding
Check If Digits Are Equal in String After Operations I
Coding
Check If Digits Are Equal in String After Operations II
Coding

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

Microsoft
Leetcode 788. Rotated Digits
Reported Jan 25, 2026 · 1 source report
MID_LEVEL
Source snapshot: Nov 12, 2026
View source

Rotated Digits

Available question text

Related questions

Rotated Digits

Available question text

Related questions