Nodes fixed by a group reversal
A list of nodes, numbered through in their starting order, is reversed in consecutive groups of (reverse nodes –, then –, and so on; divides evenly into groups). After the reversal, how many nodes remain in the same position they started in?
Show hints (2)+
- Reversing an odd-length block leaves its middle element in place.
- Count the blocks (), then one fixed node per odd block.
Answer
Reveal answer →Final answer
5
Want the full step-by-step worked solution? It's part of Premium - along with a worked solution for every question in the bank.
Asked at: Multi-Strategy Quant, Game-Based Aptitude