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 150 / 160 1300
Digit Sum 170 / 179 1400
Divisible 108 / 133 1400
Prime digit sum 115 / 124 1500
Non-palindrome number 91 / 111 1500
Yet another XOR problem 52 / 59 1600
Taboo substring 33 / 56 1700
Balanced number 20 / 25 1700
Equation 28 / 41 2100
Beautiful number 25 / 46 2100
Constructing numbers 16 / 19 2200