S Fox wrote:I think they want you to make a recursive function which uses division and modulus operators, by the example it looks like:
input: 8818
first pass: remove everything except for 8 (counts as 1, because returned one 8)
second pass: remove everything except for 818 (counts as 1, because already counted the previous 8)
third pass: remove nothing and gives back 8818 (counts as 2, because this 8 sits next to another)
thank you very much