Problem 3950 · Easy
Scan the bits of n from the lowest end, counting each place where two set bits sit next to each other.
Open the interactive visualisation