Add Digits | LeetCode 258 | C++, Java, Python3 | O(1)

****** At 13:50, I said if n%9 == 0 return 9, but mistakingly wrote 0.
LeetCode Solutions: • LeetCode Solutions | L...
June LeetCoding Challenge: • Playlist
May LeetCoding Challenge: • Playlist
Github Link: github.com/KnowledgeCenterYou...
*** Best Books For Data Structures & Algorithms for Interviews:*********
1. Cracking the Coding Interview: amzn.to/2WeO3eO
2. Cracking the Coding Interview Paperback: amzn.to/3aSSe3Q
3. Coding Interview Questions - Narasimha Karumanchi: amzn.to/3cYqjkV
4. Data Structures and Algorithms Made Easy - N. Karumanchi: amzn.to/2U8FrDt
5. Data Structures & Algorithms made Easy in Java - N. Karumanchi: amzn.to/2U0qZgY
6. Introduction to Algorithms - CLR - Cormen, Leiserson, Rivest: amzn.to/2Wdp8rZ
*****************************************************************************
July LeetCoding Challenge | Problem 26 | Add Digits | 26 July,
Facebook Coding Interview question,
google coding interview question,
leetcode,
Add Digits,
Add Digits c++,
Add Digits Java,
Add Digits python,
Add Digits solution,
258. Add Digits
#CodingInterview #LeetCode #JulyLeetCodingChallenge #Google #Amazon #AddDigits

[@KnowledgeCenter]

At 13:50, I said if n%9 == 0 return 9, but mistakingly wrote 0.

[@raiyan22]

very clear explanation, helped me understand the concept thank you

[@KnowledgeCenter]

Great to hear!

[@mohammadyahya78]

You are the best in this area so far. Thank you.

[@KnowledgeCenter]

Wow, thank you!

[@surajbaranwal56.]

may god bless you with more enlightenment, to teach such easily, and confidently. Good job man.

[@KnowledgeCenter]

Thanks, you too!

[@AlokKumar-jh8wp]

Thankyou sir for the explanation. It was nice crisp and clear

[@PiBiNi]

Great work! I like all your videos... Keep it coming

[@praveenj3112]

Thanks you for your great explanation

[@Mr_SSK]

Thank you so much! Nicely explained! :)

[@KnowledgeCenter]

Glad it was helpful!

[@sanjana8267]

Thank you so much for explaining this!!!!!

[@KnowledgeCenter]

You're so welcome!

[@chetanshrivastava3762]

Very nice explanation.God bless you..

[@KnowledgeCenter]

Thanks a lot

[@reshubnigam8375]

Hi, just wanted to know for questions like these, do you actually work out the math and then derive the intuition and algorithm? Or is it just lots of practice and a first encounter? After which we can solve because we had seen this or similar one earlier. Thank You!

[@KnowledgeCenter]

Here output is always between 1-9 (except 0, fro n=0), irrespective of how large the number is. So, In many problems like this and some oft the problems relating to Bit arithmetic, I always try to write a few examples, and see if there is any pattern. If you had written examples for 1st 20-25 numbers you would notice that It always keeps repeating in same order: 1,2,..9, 1,2...,9, 1..9.. After you find that there is a pattern, then you should try to reason out, why is this Pattern, and back it up with underlying math. I have seen similar Example Approach to find pattern and Generalize for a few Bit arithmetic problems as well.

[@rahul-patil]

You are awesome!

[@KnowledgeCenter]

Thanks.

[@gouravgoel2974]

sir, from where can we practice these type of questions I am good at solving algorithmic problems, from where can I practice maths related questions....thanks a lot for all your efforts

[@gouravgoel2974]

@@anonymousasdoasidjasd9911 thanks

[@65chass]

I have a question for which I have not been able to get a proper explanation and code example. Please help me out. The Problem Statement: There are some number of candidates who are to be voted. All the voters will vote in a preferential order. example: if the candidates are A,B,C then the Votes can be as follows: ABC BCA CBA BAC and so on...we need to find the final order in which the candidates are to be arranged. In this example like for the first position B has the maximum number of votes then B takes the first position. In case there are 2 or more than two candidates who tie for a particular position then we go on and check which one of them got the cumulative highest and then so on till one candidate wins. if till end they have a tie then they are to be arranged in a lexicographic order. I think this is the kemeny-young algorithm of preferential voting but I could not get a proper document or video explaining this algorithm. @knowledgeCentre please help me out with this problem.

[@haaarshiiiit]

Please make a video on this Binary Search question - leetcode.com/problems/find-k-closest-elements/