📅 Day 217 – LeetCode #258
🧮 Add digits until one remains
🔁 Used recursion, then optimized to O(1)
💡 Digital root = 1 (num - 1) % 9
🔥 Math tricks rock! #Java #LeetCode #AddDigits #MathTrick #DigitalRoot #300DaysOfCode #ProblemSolving

Excited to kick off the #75daysofleetcode challenge! 🎉 It's #day1 and today I solved the #AddDigits and #ReverseInteger problems in C . Looking forward to leveling up my #DSA skills through this journey! 💻 #LeetCode #Challenge #100DaysOfCode #CodingJourney #BeginnerToPro

Day 46 Given an integer num, repeatedly add all its digits until the result has only one digit, and return it. Input: num = 38 Output: 2 Explanation: The process is 38 --> 3 8 --> 11 11 --> 1 1 --> 2 Since 2 has only one digit, return it. #100daysofcoding #Java #addDigits