JavaScript Persistence bugger codewars kata

[shivajikobardan]

TL;DR

kata not solved.

I'm solving this kata:
https://www.codewars.com/kata/55bf01e5a717a0d57e0000ec/train/javascript

function persistence(n) {
  var str = n.toString();
  let finalproduct;

  if (str.length == 1) {
    return 0;
  }

  do {
    finalproduct = sop(str);
    str = finalproduct;
    str = str.toString();
  } while (str.length > 1);

  return finalproduct;
}

function sop(str1) {
  let product = 1;
  for (let i = 0; i < str1.length; i++) {
    product = product * Number(str1[i]);
  }

  return product;
}

persistence(4);

Here's my code but it is not passing few tests. Why's that?

 

[DrClaude]

Your function doesn't return what the problem asks for: the number of times you must multiply the digits in num until you reach a single digit.

 

[shivajikobardan]

Your function doesn't return what the problem asks for: the number of times you must multiply the digits in num until you reach a single digit.

thanks fixed it.