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 188 / 199 1300
Digit Sum 205 / 215 1400
Divisible 133 / 163 1400
Prime digit sum 141 / 151 1500
Non-palindrome number 111 / 134 1500
Yet another XOR problem 69 / 78 1600
Taboo substring 42 / 68 1700
Balanced number 26 / 31 1700
Equation 31 / 47 2100
Beautiful number 29 / 53 2100
Constructing numbers 17 / 21 2200