The complement of an integer is the number obtained by inverting all the bits in its binary representation without leading zeros, converting each $0$ to $1$ and each $1$ to $0$.

Given an integer num, return its complement.

Constraints:

• $1 \leq$ num $< 2^{31}$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.