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 186 / 197 1300
Digit Sum 202 / 212 1400
Divisible 131 / 161 1400
Prime digit sum 137 / 147 1500
Non-palindrome number 109 / 132 1500
Yet another XOR problem 68 / 77 1600
Taboo substring 42 / 68 1700
Balanced number 25 / 30 1700
Equation 30 / 46 2100
Beautiful number 28 / 52 2100
Constructing numbers 17 / 21 2200