Potential mistake: Chapter 5: bit manipulation "find the missing number" 5.7 per 5th edition about ctci-6th-edition HOT 1 OPEN

Was it the same as 17.4 in the 6th edition?

Missing Number: An array A contains all the integers from 0 to n, except for one number which
is missing. In this problem, we cannot access an entire integer in A with a single operation. The
elements of A are represented in binary, and the only operation we can use to access them is "fetch
the jt h bit of A[ i]," which takes constant time. Write code to find the missing integer. Can you do
it in 0( n) time?

I had the same thought, but it actually works.
The explanation for MSB is invalid though - the number of bits at MSB won't be the same if the N is different than 2^k - 1

It works at MSB, because at this point we basically have 2 options to choose from.
We have established a pattern: X010101010...01101 and here MSB can be 0 or 1.
There're only 2 numbers with this pattern.
If one with 0 is missing, then (count of 0s) < (count of 1s = 1)
If one with 1 is missing, then (count of 0s = 1) > (count of 1s = 0)
It seems that it accidentally worked :D

from ctci-6th-edition.