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);}Longvalue=Arrays.stream(n.split("")).map(s->Long::valueOf).reduce(0L,Long::sum)*k;returnsuperDigit(String.valueOf(value),1);}returnsuperDigit(String.valueOf(value),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 →
Java solution