How does repeatedly taking `num % 2` and `num // 2` peel a base-10 integer into its binary digits — and why do negatives need no extra work?
Short drills on what this video just taught. Write the code, run the checks, and reveal the answer only if you are stuck.
In the integer-to-binary algorithm, each step grabs the next bit with the remainder
operator %. The current number is 13. Compute the remainder when it is divided by 2
and assign that bit to bit.
(Hint: for any whole number, n % 2 is 0 when it is even and 1 when it is odd.)