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 108 / 118 1300
Digit Sum 122 / 129 1400
Divisible 74 / 92 1400
Prime digit sum 81 / 89 1500
Non-palindrome number 69 / 86 1500
Yet another XOR problem 30 / 36 1600
Taboo substring 24 / 40 1700
Balanced number 14 / 18 1700
Equation 18 / 28 2100
Beautiful number 17 / 35 2100
Constructing numbers 14 / 16 2200