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 79 / 85 1300
Digit Sum 89 / 95 1400
Divisible 57 / 70 1400
Prime digit sum 62 / 64 1500
Non-palindrome number 55 / 64 1500
Taboo substring 17 / 25 1600
Yet another XOR problem 23 / 24 1600
Balanced number 12 / 16 2000
Equation 16 / 21 2100
Beautiful number 15 / 24 2100
Constructing numbers 13 / 13 2200