Module Digit DP

Digit DP

**Frequency: 2/10** Digit DP problems usually ask you to count the number of numbers in a range satisfying some certain conditions. The problem statements for Digit DP typically have clear indications that the technique should be used. Hence, in a contest, it is essential to manage your time wisely when attempting Digit DP problems, as problem setters intentionally make them challenging to code. Tip: When solving problems, consider using a different number base if necessary, such as base-2, to optimize time complexity.

Resources

- [Scaler: Digit DP](https://www.scaler.com/topics/data-structures/digit-dp/)

Problems

Unlucky number 277 / 287 1300
Digit Sum 299 / 310 1400
Divisible 188 / 234 1400
Prime digit sum 200 / 213 1500
Non-palindrome number 158 / 180 1500
Yet another XOR problem 102 / 114 1600
Taboo substring 71 / 94 1700
Balanced number 36 / 42 1700
Equation 54 / 67 2100
Beautiful number 39 / 67 2100
Constructing numbers 21 / 29 2200