Such a beautiful and excellent explaination. Thank you so much I was really struggling with this problem.

Best explanation. Please keep posting more video on leetcode and other interview platform question. Thanks a lot for you nice and detailed explanation.

@codebix1096

3 жыл бұрын

Thank you. Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

Superb Explanation. In DSA only thing matters is understanding pattern which you explained clearly

bht sai h bht sahi h :)

Thanks got it.

Best explanation...

Great explanation 👍👍👍

BEST SOLUTION IN MY EYES

Thanks! Seems like top-down is your fav

@codebix1096

4 жыл бұрын

yes It is! ; )

Sir can you create a video on recursion (advance level) i got same logic but I'm not able to convert into recursion approach

Ab font size perfect hai 🤣 Thank you man! 🔥🔥🔥🔥

@codebix1096

4 жыл бұрын

join this facebook group to get updates of upcoming videos and discussions facebook.com/groups/258049468776636/about

As always awesome!!!!

@codebix1096

4 жыл бұрын

Thanks :)

Enable the option of sending thanks too

sir which mic are you using?

nice solution to this problem. sir.

@codebix1096

4 жыл бұрын

join this facebook group to get updates of upcoming videos and discussions facebook.com/groups/258049468776636/about

Superrrrr

@codebix1096

3 жыл бұрын

Thank you. Follow our linkedin page for regular updates www.linkedin.com/company/codebix/?viewAsMember=true

👌👌👌👌👌

@codebix1096

4 жыл бұрын

join this facebook group to get updates of upcoming videos and discussions facebook.com/groups/258049468776636/about

Harekrushna nnayak

Sir apart from these videos why don't u start another playlist where all the concepts of data structure such as a graph, DP, stacks, queue, etc are studied. It will help many students to clear all concepts in Data Structure and algorithm.

@codebix1096

4 жыл бұрын

sure Gaurav will do this. i will start creating video from june end on fundamandals as well like how we can implement our own hashmap, stack, queue , ...etc N ary Trees, Heaps, huffman coding, advance graph algo, backtracking , segment tree...etc

Accepted (O(n) solution (with just one single for loop without recursion) : github.com/MAZHARMIK/Leetcode-May-Challenge-2020/blob/master/Counting%20Bits%20(C%2B%2B)

@codebix1096

4 жыл бұрын

i also have video on this logic(tabulation) :) btw thanks for sharing your code

@codebix1096

4 жыл бұрын

kzread.info/dash/bejne/lKtru7inlKq_oaw.html

@codestorywithMIK

4 жыл бұрын

@@codebix1096 Thank you for your appreciation Sir. I must tell you , i have never seen someone teaching programming so patiently like you. Keep going.

@codebix1096

4 жыл бұрын

join this facebook group to get updates of upcoming videos and discussions facebook.com/groups/258049468776636/about

In python (Tabular): class Solution: def countBits(self, num: int) -> List[int]: if num == 0: return [0] dp = [0]*(num+1) dp[0] = 0 dp[1] = 1 for i in range(2,num+1): if i % 2 == 0: dp[i] = dp[i//2] else: dp[i] = 1 + dp[i//2] return dp

@codebix1096

4 жыл бұрын

Thanks Mayank for sharing :)

this can be easily solved using builtin popcount :-)

@codebix1096

4 жыл бұрын

Yes but I just wanted to share it's recursive solution

@israkulhaquetusher3256

4 жыл бұрын

@@codebix1096 thanks for your effort , i am a regular viewer of your leet code playlist :-)

@nidhimittal8929

4 жыл бұрын

Leetcode - Followup : Can you do it like a boss? Do it without using any builtin function like __builtin_popcount