can we use any other logic to count the bits
like the condition we used to check it as set or not
if(n&(n<<i)) where ith bit
then we can increment the count
so what is the best-optimized solution like using the condition discussed in this video or the condition I mentioned in this question