Dsa
Recursion
Warm-up
Multiplicative Persistence
The multiplicative persistence of a number is the number of times you must multiply its digits together before reaching a single-digit number. Calculate this count recursively.
Input: A single positive integer N.
Output: The persistence count.
Example:
Input: 39
Output: 3
(Explanation: 3*9=27, 2*7=14, 1*4=4. Total 3 steps.)
Key concepts
recursionmathdigits
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now