209 - Recursive Digit Sum | Recursion | Hackerrank Solution | Python

⭐️ Content Description ⭐️
In this video, I have explained on how to solve recursive digit sum using recursion in python. This hackerrank problem is a part of Problem Solving | Practice | Algorithms | Recursion | Recursive Digit Sum and solved in python.
🔔 Subscribe: bit.ly/hackersr...
🗓️ 1:1 Consultation with Me: calendly.com/h...
📷 Instagram: / aswintechguy
🔣 Linkedin: / aswintechguy
🎯 GitHub: github.com/asw...
🎬 Share: • 209 - Recursive Digit ...
⚡️ Data Structures & Algorithms tutorial playlist: bit.ly/dsatutorial
😎 Hackerrank problem solving solutions playlist: bit.ly/hackerra...
🤖 ML projects tutorial playlist: bit.ly/mlprojec...
🐍 Python tutorial playlist: bit.ly/python3p...
💻 Machine learning concepts playlist: bit.ly/mlconcepts
✍🏼 NLP concepts playlist: bit.ly/nlpconcepts
🕸️ Web scraping tutorial playlist: bit.ly/webscrap...
Make a small donation to support the channel 🙏🙏🙏:-
🆙 UPI ID: hackersrealm@apl
💲 PayPal: paypal.me/hack...
#recursivedigitsum #hackerranksolutions #hackersrealm #hackerrank #python #recursion #howtosolve #problemsolving #tutorial #algorithms #datastructures #programming #coding #codinginterview #education #aswin

[@SendiSiradj]

thank you for the explanation. this problem is similar to the "digital root" in number theory

[@ENGCS_ADARSHAVT]

Thank you for the optimized solution

[@HackersRealm]

Happy to help!!!😄

[@sagaruttare936]

nice

[@ashitoshfating7154]

why the constraint value of n is so high 10^100000, it is generally at max 10^18 right?

[@HackersRealm]

sometimes they set unreasonable constraint for the users to go only for the optimal approach at the start itself

[@tarusakinichiima877]

I get runtime errors

[@HackersRealm]

try to set recursion limit to avoid that

[@meru_zh]

@@HackersRealm how much?

[@HackersRealm]

@@meru_zh 10^6 to 10^8 is sufficient