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 81 / 87 1300
Digit Sum 91 / 97 1400
Divisible 59 / 72 1400
Prime digit sum 64 / 66 1500
Non-palindrome number 55 / 66 1500
Taboo substring 17 / 26 1600
Yet another XOR problem 23 / 25 1600
Balanced number 12 / 16 2000
Equation 17 / 23 2100
Beautiful number 15 / 25 2100
Constructing numbers 13 / 13 2200