Find rightmost different bit between 2 numbers

This video explains a very interesting problem about finding rightmost different bit between two numbers efficiently. This problem has been solved by using the bitmasking approach. This problem is a tricky one and is frequently asked in coding interviews. 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 :)