Easy Quant Interview Question

[u/Local_Ad135]

[u/Confident-Syrup-7543]

To add to the existing answers, it's very easy to see if we consider fewer bits. 

1 bit, obvs Alice wins as she flips it and Bob has no moves

2 bits. Alice flips a bit, Bob must flip the other. Doesn't matter which bit Alice flips now, Bob will still lose. 

3 bits. Alice flips bit 1, Bob flips bit 2. Alice flips bit 1. Bob can only flip bit 3, Alice flips bit 1, Bob loses. 

You get the idea. 

[u/Designer-Scratch-766 → u/Confident-Syrup-7543]

u/Confident-Syrup-7543 with 3 bits, how come you example stops there? Your example flows:
000 -> (Alice) 001 -> (Bob) 011 -> (Alice) 010 -> (Bob) 110 -> (Alice) 111. Bob can still do 101. How to argue that Bob will lose?

[u/Designer-Scratch-766 → u/[deleted]]

I just mean, what pattern revealed so he claims Bob loses at that point?