HackerRank XOR Strings 3 problem solution

In this HackerRank XOR Strings 3 problem solution, we have given two strings consisting of digits 0 and 1 only, find the XOR of the two strings.

Problem solution in Python.

```def strings_xor(s, t):
res = ""
for i in range(len(s)):
if s[i] == t[i]:
res = res + '0'
else:
res = res + '1'

return res

s = input()
t = input()
print(strings_xor(s, t))
```

Problem solution in Java.

```import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

public static String stringsXOR(String s, String t) {
String res = new String("");
for(int i = 0; i < s.length(); i++) {
if(s.charAt(i) == t.charAt(i))
res += "0";
else
res += "1";
}

return res;
}

public static void main(String[] args) {

String s, t;
Scanner in = new Scanner(System.in);
s = in.nextLine();
t = in.nextLine();
System.out.println(stringsXOR(s, t));

}

}
```

Problem solution in C++.

```#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;

string strings_xor(string s, string t) {

string res = "";
for(int i = 0; i < s.size(); i++) {
if(s[i] ^ t[i])
res += '1';
else
res += '0';
}

return res;
}

int main() {
string s, t;
cin >> s >> t;
cout << strings_xor(s, t) << endl;
return 0;
}
```