Add Digits | With Proof | (MICROSOFT, ADOBE) | Leetcode-258 | Live Code + Explanation

This is the 4th Video on our Maths Playlist.
In this video we will try to solve a very good and interesting Problem "Add Digits" (Leetcode - 258)
We will do live coding after explanation and see if we are able to pass all the test cases.
Problem Name : Add Digits
Company Tags : MICROSOFT, ADOBE
My solutions on Github : github.com/MAZ...
Leetcode Link : leetcode.com/p...
My GitHub Repo for interview preparation : github.com/MAZ...
Subscribe to my channel : / @codestorywithmik
╔═╦╗╔╦╗╔═╦═╦╦╦╦╗╔═╗
║╚╣║║║╚╣╚╣╔╣╔╣║╚╣═╣
╠╗║╚╝║║╠╗║╚╣║║║║║═╣
╚═╩══╩═╩═╩═╩╝╚╩═╩═╝
#coding #helpajobseeker #easyrecipes #leetcode #leetcodequestionandanswers #leetcodesolution #leetcodedailychallenge #leetcodequestions #leetcodechallenge #hindi #india #hindiexplanation #hindiexplained #easyexplaination #interview #interviewtips
#interviewpreparation #interview_ds_algo #hinglish

[@codeandtalk6]

2nd approach was 😮 ❤

[@aryabhishekverma]

yes but why was leetcode showing that the first approach is faster than 100%?

[@mar-cosgupta7330]

Gjb

[@gautamarora6556]

Tips: • Any number which is divisible by 9 has the sum of digits adding up to 9 always. • Therefore, the digital root for any number divisible by 9 is always 9. • The digital root (ans) for 0 is always 0. • For any number that isn't 0 and isn't divisible by 9, the digital root (ans) will always be n % 9, where n is the given number. • This is because the difference between the given number and the nearest number that is divisible by 9 will always be a multiple of 9, and therefore have a digital root of 9. • This algorithm skips the "add digits until there is only 1 remaining" method for finding the digital root. • The Leetcode problem may be misleading in its description, but it is important to learn all of these tricks.

[@codestorywithMIK]

Amazing ❤️

[@anuppatankar4294]

Second approach was awesome 👌🏻

[@prabhkiratsingh8490]

It has been four months since I started following your channel. Amazing content🔥 Would it be possible for you to start uploading GFG POTD as well? It would be really helpful.

[@codestorywithMIK]

Thank you so much Prabhkirat ❤️ I have not yet planned GFG POTD due to time constraints but soon i will be trying to cover them too. Because the qns are good there too

[@prabhkiratsingh8490]

@@codestorywithMIK Sure 👍, BTW it's Prabhkirat*

[@codestorywithMIK]

So sorry for the typo. Corrected the spelling. Thank you for visiting my channel ❤️❤️❤️

[@prabhkiratsingh8490]

@@codestorywithMIK No issues Bro ❣❣You are doing a great job👍I'm glad I found this gem on KZbin.

[@codestorywithMIK]

❤️❤️❤️

[@good114]

💗❤️

[@wearevacationuncoverers]

you are a master

[@souravjoshi2293]

Always learning from you

[@NishantSingh-br6iu]

Optimal Approach was 🔥🔥

[@codestorywithMIK]

🙏😇

[@ankitsingh6624]

🔥 Always learn something

[@codestorywithMIK]

Thanks a lot ❤️

[@jameskurakula3250]

Nice explanation 👍

[@codestorywithMIK]

Thanks James ❤️❤️❤️

[@ghayoorhussain8930]

Thank You Soo Much Sir

[@codestorywithMIK]

Thanks a lot ❤️

[@YashSinghal]

other way of doing the same logic brute force: int sumDigits(int num){ int sum = 0; while(num>9){ sum += num%10; num = num/10; } return sum+num; } int addDigits(int num){ while(num>9){ num = sumDigits(num); } return num; }

[@souravjoshi2293]

Nice

[@YashSinghal]

@@souravjoshi2293 ty :)

[@rahulmaurya6451]

Why optimal approach is Taking more time than Brute Force ?

[@codestorywithMIK]

Sometimes it happens on leetcode. Try submitting multiple times, it sometimes shows 100% and sometimes not.

[@manimanohar_001]

BTW remainder leetcode 92

[@elakstein]

11:50 how can we say it as =9*constant + Sd. the part we are multiplying with 9 contains d0,d1 etc they aren't constant.

[@codestorywithMIK]

The part where all terms are multiplied by 9 , if you take 9 common, then other remaining terms will sum up to some number . Which we can denote as some constant K may be. Yes, the value will be different every time, but the crux is that 9 can be taken out common .

[@pritishpattnaik4674]

Bhaiya , I have a doubt , this is off topic , can u please make a video about the conversions like char to int , int to char by adding or subtracting 0 or subtracting or adding a or 0 like that , I always get confuised in those things , please help sir

[@codestorywithMIK]

That’s a wonderful idea. Can you please remind me this weekend about this ❤️

[@pritishpattnaik4674]

@@codestorywithMIK yes sir sure

[@manimanohar_001]

Bro notification nhi aarha hai aapke channel ka

[@codestorywithMIK]

I think you will have to press the Bell Icon and select All from the options.

[@manimanohar_001]

@@codestorywithMIK hua pada hai bro phir bhi nhi aarha hai

[@codestorywithMIK]

Hmm strange. Not sure. May b glitch from KZbin