Complement of Base 10 Number

Try to solve the Complement of Base 10 Number problem.

We'll cover the following

Statement#

For any $n$ positive number in base 10, return the complement of its binary representation as an integer in base 10.

Constraints

1 of 3

2 of 3

3 of 3

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:

Complement of Base 10 Number

What is the correct output if the following value is given as input?

Input = 39

Question 1 of 60 attempted

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

Drag and drop the cards to rearrange them in the correct sequence.

Calculate the number of bits required to store any given positive integer.

Create an all bits set against the number of bits of the input value.

Flip all occurrences of $1$ s to $0$ s and $0$ s to $1$ s by computing the $\text{XOR}$ operation.

Convert the binary value back to base 10 and return the complement.

Implement your solution in the following coding playground.

Python

usercode > main.py

def find_bitwise_complement(num):
  
    # Replace this placeholder return statement with your code
    return -1

d

Enter to Rename, Shift+Enter to Preview

Input #1

Complement of Base 10 Number

Solution: Find the Difference

Solution: Complement of Base 10 Number