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.
publicstaticintsuperDigit(Stringn,intk){// Write your code hereif(n.length()==1)returnInteger.parseInt(n);longcount=0;for(inti=0;i<n.length();i++){count+=Integer.parseInt(n.substring(i,i+1));}count*=k;returnsuperDigit(Long.toString(count),1);}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Recursive Digit Sum
You are viewing a single comment's thread. Return to all comments →