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 101 / 111 1300
Digit Sum 116 / 123 1400
Divisible 71 / 89 1400
Prime digit sum 77 / 85 1500
Non-palindrome number 64 / 81 1500
Yet another XOR problem 27 / 33 1600
Taboo substring 21 / 36 1700
Balanced number 14 / 18 1700
Equation 17 / 28 2100
Beautiful number 16 / 34 2100
Constructing numbers 14 / 15 2200