# LC3301: Count Beautiful Numbers in Range Study notes for the **Count Beautiful Numbers in Range** pattern (digit DP). ## Problem sketch Count how many integers in [low, high] are 'beautiful' (digit product divisible by digit sum). Classic digit DP with product/sum state. ## Approach checklist 1. Restate constraints and edge cases out loud. 2. Name the core pattern (digit DP) before coding. 3. Walk a small example on the whiteboard. 4. Discuss time/space trade-offs and follow-ups. ## Practice tip When I rehearse this family of problems I keep a short checklist and a timer. For live rounds I also keep [Linkjob AI](https://www.linkjob.ai/) open as a quiet study aid so I can compare my outline to a structured walkthrough after the mock. ## Complexity Depends on the exact constraints; say the bound before you code and confirm with the interviewer.