Majority element in an array | Bitmasking

This video explains a very frequently asked interview question which is to find the majority element in an array. I have concentrated on explaining the bitmasking approach to find the majority element in an array, which is one the efficient methods to do so. First i have explained the method and then the CODE and at last i have explained the TIME & SPACE complexity. So, do watch the video till the end to get a good grasp on the problem. As usual, CODE LINK is present below. 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 :)


CODE LINK: https://gist.github.com/SuryaPratapK/...

==========================================================

Check if Kth bit is SET:    • Check if Kth bit is set or not