Easy data structure and algorithm practice puzzle.
Given the raw bits of a signed integer, read as an unsigned number, and its width in bits, return the value it actually stores. In two's complement, the top bit counts as negative. If it's set, subtract 2 to the power width from the value. So the 8-bit pattern 11111111 is -1, not 255.
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.
Browse all 546 puzzles