We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
For setBits function using Brian Kernighan’s Algorithm took O(log n).
So how this solution is only in O(b). I am a beginner in time complexities. An explaination would be greatly appreciated.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Counter game
You are viewing a single comment's thread. Return to all comments →
For setBits function using Brian Kernighan’s Algorithm took O(log n). So how this solution is only in O(b). I am a beginner in time complexities. An explaination would be greatly appreciated.