Complement of Base 10 Integer Problem

Complement of Base 10 Integer Problem — ExecCode Easy DSA Practice

Solve the Complement of Base 10 Integer problem on ExecCode. Free online easy DSA practice in Bit Manipulation. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given an integer n, return its complement. Your task is to the complement of an integer is the integer you get when you flip all the 0's to 1's and all the 1's to 0's in its binary representation. For example, The integer 5 is "101" in binary and its complement is "010" which is the integer 2. Return the required answer exactly as shown in the examples.

Examples

Input {"n": 5}; Output 2. Input {"n": 7}; Output 0

Constraints

0 <= n < 10^9

Practice Complement of Base 10 Integer free on ExecCode. Browse DSA problems, topic map, and placement guides.