Problem statement : Create a function that takes a number and returns its multiplicative persistence, which is the number of times you must multiply the digits in num until you reach a single digit.
Probelm Link : Persistent Little Bugger
Choose one Cateorgy - Very Easy, Easy, Medium, Hard, Very Hard, Expert
question category : Hard
Before submitting a PR please Check some details.
[ ] fileName formet should be in camelcase
example- returnTheNextNumber.py
[ ] Choose label for Problem , example- "good first issue", "easy"
[ ] In file there should be problem statement and link to problem
/* Problem-Task : This program will add two numbers
* Problem Link : https://edabit.com/challenge/SFzHtm63XT6EYNHWY
*/
int main() {
int bla;
return 0;
}
div5252
commented
4 years ago
Before jumping into Pr first comment for assign.
Problem statement : Create a function that takes a number and returns its multiplicative persistence, which is the number of times you must multiply the digits in num until you reach a single digit. Probelm Link : Persistent Little Bugger Choose one Cateorgy - Very Easy, Easy, Medium, Hard, Very Hard, Expert question category : Hard
Before submitting a PR please Check some details.
This repository is vaild for HacktoberFest2020
Read before making PR - How to contribute on Github Good Luck,