Medium data structure and algorithm practice puzzle.
Given a byte, swap every pair of neighboring bits and return the result. So 1 (01) becomes 2 (10). Grab the odd-position bits with the mask 170 (10101010) and shift them right one. Grab the even-position bits with 85 (01010101) and shift them left one. OR the two together. No loop needed.
Solve it three ways: snap the jigsaw pieces together, fill in the blanks, or type it from scratch against the tests. This one is free.
Every line of the solution comes with a note explaining why it is there, and a step by step replay shows the code running. At level 3, where you type it yourself, you can ask for an AI mock interview on this problem that ends with a hiring manager's scorecard.
Then grow it into a real project with the Software Engineer button: this puzzle becomes the Read Flag Store, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles