-
Notifications
You must be signed in to change notification settings - Fork 0
/
Hackerrank in a string.java.txt
56 lines (45 loc) · 1.37 KB
/
Hackerrank in a string.java.txt
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
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 hackerrankInString function below.
static String hackerrankInString(String s) {
//int counts[]=new int[256];
int i;
String str="hackerrank";
//int j=0;
for(i=0;i<str.length();i++)
{
int ind=s.indexOf(str.charAt(i));
if(ind==(-1))
{
return "NO";
}
else
{
s=s.substring(ind+1);
System.out.println("s="+s);
}
//j++;
}
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 s = scanner.nextLine();
String result = hackerrankInString(s);
bufferedWriter.write(result);
bufferedWriter.newLine();
}
bufferedWriter.close();
scanner.close();
}
}