Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
Leetcode 1922. Count Good Numbers
Count the number of length-n digit strings where digits at even indices must be even (5 choices) and digits at odd indices must be prime (4 choices); the total is 5^{ceil(n/2)} * 4^{floor(n/2)} modulo 10^9+7. Because n can be up to 10^15, compute powers with fast modular exponentiation.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.