XOR Strings 2 Problem in Java | Hacker Rank Interview Preparation | 1 Month Preparation Kit.

This video is about Step by step explanation of XOR Strings 2 problem on Hacker Rank.
---------------------------------------------------------------------------------------------------------------------
Given two strings consisting of digits 0 and 1 only, find the XOR of the two strings.

To know more about XOR Click Here

Debug the given function strings_xor to find the XOR of the two given strings appropriately.

Note: You can modify at most three lines in the given code and you cannot add or remove lines to the code.

To restore the original code, click on the icon to the right of the language selector.

Input Format

The input consists of two lines. The first line of the input contains the first string, s, and the second line contains the second
string, t.

Output Format

Print the string obtained by the XOR of the two input strings in a single line.

Sample Input

10101
00101

Sample Output

10000

Explanation

The XOR of the two strings 10101 and 00101 is 1+0, 0+0, 1+1, 0+0, 1+1 = 10000.

#xorstrings2 #hackerrank #solution #string #xor #strings2
---------------------------------------------------------------------------------------------------------------------

Just visit the below website for code:-
Don't' Forget to Like, Share and Subscribe for future updates...
Thank you!!!!!!!!
After copying and pasting the code, still not working
Don't Worry I'm hereby to help you
Ping me on Instagram.