-
Notifications
You must be signed in to change notification settings - Fork 5
/
Two Strings(HackerRank)
61 lines (49 loc) · 1.49 KB
/
Two Strings(HackerRank)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
import java.io.*;
import java.math.*;
import java.security.*;
import java.text.*;
import java.util.*;
import java.util.concurrent.*;
import java.util.regex.*;
public class Solution {
// Complete the twoStrings function below.
static String twoStrings(String s1, String s2)
{
// System.gc();
String result = "NO";
if(s1.equals(s2))
{
result = result.replace(result,"YES");
return result;
}
for(int i=0;i<s1.length();i++)
{
if(0 <= s2.indexOf(s1.charAt(i)))
{
result = result.replace(result,"YES");
return result;
}
// else if(i == 5)
// break;
}
// System.gc();
return result;
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
System.gc();
BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));
int q = scanner.nextInt();
scanner.skip("(\r\n|[\n\r\u2028\u2029\u0085])?");
for (int qItr = 0; qItr < q; qItr++) {
String s1 = scanner.nextLine();
String s2 = scanner.nextLine();
String result = twoStrings(s1, s2);
bufferedWriter.write(result);
bufferedWriter.newLine();
}
System.gc();
bufferedWriter.close();
scanner.close();
}
}