We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
intnum1(longlongintz){if(z<=9){returnz;}longlongintsum=0;longlongintm=0;while(z!=0){m=z%10;sum=sum+m;z=z/10;}returnnum1(sum);}// Complete the superDigit function below.intsuperDigit(stringn,intk){longlongintsum=0;longlongintm;for(inti=0;i<n.size();i++){sum+=n[i]-'0';}returnnum1(sum*k);}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Recursive Digit Sum
You are viewing a single comment's thread. Return to all comments →
Here's the C++ Code, All test cases passing