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 54 / 59 1300
Digit Sum 61 / 66 1400
Divisible 41 / 50 1400
Prime digit sum 41 / 43 1500
Non-palindrome number 39 / 44 1500
Taboo substring 13 / 20 1600
Yet another XOR problem 16 / 17 1600
Balanced number 9 / 12 2000
Equation 12 / 15 2100
Beautiful number 10 / 16 2100
Constructing numbers 9 / 9 2200