New update is available. Click here to update.

Last Updated: 18 Feb, 2021

Difficulty: Easy

```
A binary string contains only ‘0’ or ‘1’.
2’s complement is 1’s complement + 1.
For example, 2’s complement of 00000101 is 11111011.
```

```
The first line of input contains an integer T denoting the number of test cases.
The next line contains a string of length N.
```

```
For each test case, print the 2’s complement of the given string in a separate line.
```

```
You don’t have to print anything; it has already been taken care of. Just implement the given function.
```

```
1 <= T <= 5
1 <= N <= 20
where ‘T’ is the total number of test cases, and N is the length of the string.
Time Limit : 1sec
```

Popular Interview Problems: