HackerRank in a String! - HackerRank Solution.

-
NOTE: If you are copying my code then its an 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.

We say that a string contains the word hackerrank if a subsequence of its characters spell the word hackerrank. For example, if string  it does contain hackerrank, but  does not. In the second case, the second r is missing. If we reorder the first string as , it no longer contains the subsequence due to ordering.
More formally, let  be the respective indices of h, a, c, k, e, r, r, a, n, k in string . If  is true, then  contains hackerrank.

For each query, print YES on a new line if the string contains hackerrank, otherwise, print NO.
Function Description
Complete the hackerrankInString function in the editor below. It must return YES or NO.
hackerrankInString has the following parameter(s):
  • s: a string
Input Format
The first line contains an integer , the number of queries.
Each of the next  lines contains a single query string .
Constraints
Output Format
For each query, print YES on a new line if  contains hackerrank, otherwise, print NO.
Sample Input 0
2
hereiamstackerrank
hackerworld
Sample Output 0
YES
NO
Explanation 0
We perform the following  queries:

  1. The characters of hackerrank are bolded in the string above. Because the string contains all the characters in hackerrankin the same exact order as they appear in hackerrank, we print YES on a new line.
  2.  does not contain the last three characters of hackerrank, so we print NO on a new line.
Sample Input 1
2
hhaacckkekraraannk
rhbaasdndfsdskgbfefdbrsdfhuyatrjtcrtyytktjjt

Sample Output 1
YES
NO


SOURCE CODE


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) {
char ar[]={'h','a','c','k','e','r','r','a','n','k'};
int k=0;
for(int i=0;i<s.length();i++)
{
if(s.charAt(i)==ar[k])
{
k++;
if(k==ar.length)
break;
}
}
if(k==ar.length)
return ("YES");
else
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 s = scanner.nextLine();

String result = hackerrankInString(s);

bufferedWriter.write(result);
bufferedWriter.newLine();
}

bufferedWriter.close();

scanner.close();
}
}




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