Recent | Popular
#java #gfg #geeksforgeeks #recursion #digitalroot
class Solution { public static int digitalRoot(int n) { if(n < 10) return n; return digitalRoot(n%10 + n/10); } }
Sun Feb 06 2022 22:48:51 GMT+0000 (Coordinated Universal Time) https://practice.geeksforgeeks.org/problems/digital-root/1/?track=DSASP-Recursion&batchId=190
