Counting Bits | Leetcode #338

This video explains a very important programming interview problem which is to find the number of set bits for all numbers from 0 to N and push them in an array and return as answer.This problem is frequently repeated in interview.There are many approaches to solving this problem but the simplest is to just iterate over all the numbers and every bit of each number and find the count of set bits.This takes O(NlogN) time.I have shown this approach as method-1 in this video.We can further optimize this solution by using simple observations and use extra space of O(N) to just solve it in O(N) time.I have shown the entire intuition with examples and CODE for this optimized solution as method 2. CODE LINK is present below as usual. If you find any difficulty or have any query then do COMMENT below. PLEASE help our channel by SUBSCRIBING and LIKE our video if you found it helpful...CYA :)

=================================================================
INSTAGRAM: https://www.instagram.com/surya.pratap.k/
LinkedIn: https://www.linkedin.com/in/surya-pratap-kahar-47bb01168
=================================================================

CODE LINK: https://gist.github.com/SuryaPratapK/700ed22ce5ff160ac9c7615b0e58debf
SIMILAR PROBLEMS:-
Bitwise AND of numbers range: https://youtu.be/-qrpJykY2gE
Majority element in an array (BitMasking): https://youtu.be/0s3zqYaDInE

Видео Counting Bits | Leetcode #338 канала TECH DOSE