-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtwoStrings.java
99 lines (74 loc) · 2.67 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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
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) {
HashSet<String> set = new HashSet<String>();
// Solution 1
// full solution (but it's slow) - running time[O(n^2)]
for(int i=0; i < s1.length(); i++) // makes set of all substrings of s1 string
{
set.add(String.valueOf(s1.charAt(i)));
for(int j=i+1; j < s1.length(); j++)
{
set.add(s1.substring(i, j+1));
}
}
System.out.println(set);
for(int k=0; k < s2.length(); k++) // cheaks is substrings in s2 are also occure in set made by (s1 substrings)
{
if(set.contains(String.valueOf(s2.charAt(k))))
{
return "YES";
}
for(int z=k+1; z < s2.length(); z++)
{
if(z+1 == s2.length())
{
if(set.contains(s2.substring(k)))
{
return "YES";
}
}
if(set.contains(s2.substring(k, z+1)))
{
return "YES";
}
}
}
// Solution 2
// only cheaks for chars (fast and serves the need of this perticuler question) - running time[O(n)]
for(int i=0; i < s1.length(); i++) // makes SET of s1 string chars
{
set.add(String.valueOf(s1.charAt(i)));
}
for(int j=0; j < s2.length(); j++) // cheaks if s2 string chars present in set form by s1 string chars
{
if(set.contains(String.valueOf(s2.charAt(j))))
{
return "YES";
}
}
return "NO";
}
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();
}
}