-
Notifications
You must be signed in to change notification settings - Fork 0
/
twostrings.java
67 lines (51 loc) · 1.8 KB
/
twostrings.java
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
62
63
64
65
66
67
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) {
// begin to code here
// create a dictionary/hashmap in java, prep for amazon interview
HashMap<Character, Integer> s1letters = new HashMap <Character, Integer>();
// determine if s1 and s2 share a common substring
for(int i=0; i<s1.length(); i++){
// iterate through s1 and add to a dictionary of strings
s1letters.put(s1.charAt(i), 1);
}
// now we have a dictionary of strings to iterate through
boolean nosub = true;
int counter=0;
while(nosub==true && counter<s2.length()){
if (s1letters.containsKey(s2.charAt(counter))) {
nosub=false;
break;
}
counter++;
}
if(nosub==true){
return "NO";
}
else{
return "YES";
}
}
private static final Scanner scanner = new Scanner(System.in);
public static void main(String[] args) throws IOException {
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();
}
bufferedWriter.close();
scanner.close();
}
}