Write a function, persistence, that takes in a positive parameter num and returns its multiplicative persistence, which is the number of times you ...
For further actions, you may consider blocking this person and/or reporting abuse
Haskell solution:
Edit:
Inspired by other solutions I realized that I don't need to track recursion depth
Nice use of pointfree style!
TypeScript
Nice 👌
My Swift solution :
Python solution
JS
Python solution with test cases.
Elixir
C++ solution
Recursive JavaScript solution:
JS solution