XOR String - HackerRank.

-

NOTE: If you are copying my code then its a advice to you to copy it after downloading it to avoid any kind of compilation error its link is available at the bottom of the source code.


In this challenge, the task is to debug the existing code to successfully execute all provided test files.
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 in the editor, create a new buffer by clicking on the top left icon in the editor.
Input Format
The input consists of two lines. The first line of the input contains the first string, , and the second line contains the second string, .
Constraints
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  and  is .


SOURCE CODE




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 = res+"0";
else
res = 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));

}

}





Click here to Download



RESULT








If you have any question then leave a comment below I will do my best to answer that question.

Comments

Post a Comment

Popular posts from this blog

Pattern of your own name.

-
Image
Pattern program of your own name. This is a pattern program, in this program you just have to enter your name and it will give you output in a particular manner. I have created this program when I was in class 10th for my Computer Application project. NOTE:  If you are copying my code then its a advise to you to copy it after downloading it to avoid any kind of compilation error its link is available at the bottom of source code. SOURCE CODE import java.io.*; public class Patter_of_your_Own_Name { public static void main(String args[])throws IOException { int time=1; BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); do { System.out.print("\n\t\t\tPLEASE,ENTER YOUR GOOD NAME IN CAPITAL LETTER           :"); String str=br.readLine(); int flag=0;
Read more

[Question 3] ISC 2017 Computer Practical Paper Solved – Caesar Cipher.

-
Image
Question 3: Caesar Cipher  is an encryption technique which is implemented as ROT13 (‘rotate by 13 places’). It is a simple letter substitution cipher that replaces a letter with the letter 13 places after it in the alphabets, with the other characters remaining unchanged. Write a program to accept a plain text of length L, where L must be greater than 3 and less than 100. Encrypt the text if valid as per the Caesar Cipher. Test your program with the sample data and some random data: Example 1 INPUT :  Hello! How are you? OUTPUT :  The cipher text is: Uryyb? Ubj ner lbh? Example 2 INPUT :  Encryption helps to secure data. OUTPUT :  The cipher text is: Rapelcgvba urycf gb frpher qngn. Example 3 INPUT :  You OUTPUT :  INVALID LENGTH SOURCE CODE    import java.io.*; import java.util.*; public class ISC2017_CaesarCipher {     public static void main(String args[])     { ...
Read more

ISBN Number.

-
Image
Program to check whether a given number is ISBN number or not. An ISBN(International Standard Book Number) is a ten digit code which uniquely identifies a book. The first nine digits represent the Group, Publisher and Title of the book. Each of the first nine digits of the code can take a value between 0 and 9. Sometimes it is necessary to make the last digit equal to ten, this is done by writing the last digit of the code as 'X' To verify an ISBN number, calculate 10 times the fist digit, plus 9 times the second digit, plus 8 times the third and so on until 1 time the last digit. If the final number leaves no remainder when divided by 11, the code is a valid number. eg. 007462542X = (10*0)+(9*0)+(8*7)+(7*4)+(6*6)+(5*2)+(4*5)+(3*4)+( 2*2)+(1*10)=176 Similarly 0764526413 and 0112362221                           SOURCE CODE import java.io.*; public class ISBN {     pu...
Read more