Persistence

[jatinAgarwala]

Before jumping into Pr first comment for assign.

Problem statement : The additive persistence of an integer, n, is the number of times you have to replace n with the sum of its digits until n becomes a single digit integer.

The multiplicative persistence of an integer, n, is the number of times you have to replace n with the product of its digits until n becomes a single digit integer.

Create two functions that take an integer as an argument and:

Return its additive persistence.
Return its multiplicative persistence.

Probelm Link : https://edabit.com/challenge/vHvu4Wis8RhmQbwXm Choose one Cateorgy - Very Easy, Easy, Medium, Hard, Very Hard, Expert question category : Very Hard

---

Before submitting a PR please Check some details.

• [x] fileName formet should be in camelcase example- returnTheNextNumber.py
• [x] Choose label for Problem , example- "good first issue", "easy"
• [x] 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;
  }

This repository is vaild for HacktoberFest2020

Read before making PR - How to contribute on Github Good Luck,

[jatinAgarwala]

Please assign this to me.