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 132 / 142 1300
Digit Sum 151 / 158 1400
Divisible 98 / 117 1400
Prime digit sum 101 / 109 1500
Non-palindrome number 82 / 100 1500
Yet another XOR problem 42 / 49 1600
Taboo substring 29 / 50 1700
Balanced number 16 / 20 1700
Equation 21 / 33 2100
Beautiful number 23 / 41 2100
Constructing numbers 15 / 18 2200