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 164 / 174 1300
Digit Sum 180 / 189 1400
Divisible 113 / 139 1400
Prime digit sum 118 / 127 1500
Non-palindrome number 92 / 112 1500
Yet another XOR problem 54 / 61 1600
Taboo substring 36 / 59 1700
Balanced number 21 / 26 1700
Equation 28 / 41 2100
Beautiful number 26 / 47 2100
Constructing numbers 17 / 20 2200