u r right this testcase needs to be added.

This test case works perfectly fine for me but test case# 3 fails.

Lol. Bra. You must check if they're in a column.

My code failed in your example :)

Good observation #vangoor_bharath

I was able to get full marks on this exercise from this simple test case. If I may add my own recommendation then I would suggest you take the 12 and 34 and add it to the row below.

4 6

123412

561212

123612

781234

2 2

12

34

Sorry don't know how to add a code block here.

I agree. It seems like there aren't any test cases checking for column offsets.

Edit: I realized this test case should return "YES" (See the end of 2nd and 3rd row).

However, it seems like this test case needs to be added:

1
3 3
123
456
789
2 2
45
89

This should fail since the 45 in row 2 and 89 in row 3 is not aligned properly.

my code fails too for that example

Thanks to your case I found a flaw in my code which only failed me at test case 5! I was struggling on case 5!

I agree, this helped me spot an error in my logic.

this works fine but fails case#5

I had a similar experience. My code passed all test cases. But, it failed on the following input:

1

5 15

111111111111111

111111111111111

111111011111111

111111111111111

111111111111111

3 5

11111

11111

11110

Hi Bharath,

Did you specify the number of test cases T in the first line ? Maybe you missed adding that.

Thanks, this helped me see the problem with test case #5.

Actually, I downloaded the test case so I could check it out, but with a 1000x1000 matrix it was too large.

Your sample demonstrated the edge case (hehehe) much more clearly!

good observation. code needs to be perfectly fine to pass this testcase. p.s my code passed your testcase.

good observation. code needs to be perfectly fine to pass this testcase. p.s my code passed your testcase.

mine passed all test cases as well your's too

missing number of test cases at the beginning ? 1 <--------------------- 4 6 123412 561212 123634 781288 2 2 12 34

this totally needs to be added.

One mate resolve this reading lines as string, and doing indexOf from pattern lines and checking indexOf of each line are equals than previous indexOf. Tests cases went all fine for him and obtained maximum score, but this test failed for him.

My solution checks matrix positions and this case works fine and tests too.

thnx for the test case!! got full points after my pgm passed this test case.

This is getting an YES for my code, though my code is failing for test case # 5 :(

This test case works for me. However test case #5 fails :(

working perfectly!!!

hey, thankx for that testcase.. my code was working for all cases apart #5, and since that test case was huge (1000x1000 grids), I couldnt figure out where the code was failing.. ur testcase helped me figure out the logic error.. thankx

My code was not working in Test Case #5, but after using your suggestion as a custom test I was able to debbug my algotithm.

Fortunately it was a simple mistake, I was not checking the last rows/columns of the original grid.

Author's test case #5 got me.

vangoor_bharath's proposed test case helped me debug a silly off-by-one error.

it works fine for me but other test case fails in set.

It works in mine. Though it took a while before I figured out that your input doesn't have a test-case number ^^

Thanks for this testcase

I wonder why this edge case is not preceded before the scalability test

This is very helpful, thanks! but should add "1" in the beginning to specify number of test cases:

1
4 6
123412
561212
123634
781288
2 2
12
34

thanks

My code works fine for all test cases and this one too

#include<iostream>

using namespace std;

int main()
{
int T,i;
cin>>T;
for(i=1;i<=T;i++)
{
    int R,C,r,c,flag=0,final=0;
    cin>>R>>C;
    char G[R][C];
    for(int j=0;j<R;j++)
    for(int k=0;k<C;k++)
    cin>>G[j][k];
    cin>>r>>c;
    char P[r][c];
    for(int j=0;j<r;j++)
    for(int k=0;k<c;k++)
    cin>>P[j][k];

for(int j=0;j<R;j++)
for(int k=0;k<C;k++)
{   

if(G[j][k]==P[0][0])
    {   
        int flag=1;
    if(C-k>=c)  
    for(int pr=0;pr<r;pr++)
    {
    if(flag==0)
    break;  
    for(int pc=0;pc<c;pc++)
    {   

        if(G[j+pr][k+pc]==P[pr][pc]){
            if(pr==r-1&&pc==c-1)
                final=1;
            flag=1;
            }
        else{   
        flag=0;
        break;
        }
    }
}
}
}
if(final)
cout<<"YES"<<endl;
else
cout<<"NO"<<endl;
}
}

My code passes your test case, but my time complexity is probably not good.

I was afraid of this, my though was that the program would see the first 12 that appeas on the second row, check for the pattern, and go on to the next row. I had to accumulate the indexes where the first line of the pattern appeared and check them all.

Similar to test case 15 for which my code fails... maybe I need to maintain a list or vector of pairs which will have the column nos. of the starting and ending indices of each row of the test grid found as present in the main grid. And so if the pattern really exists, then every pair of the list must be the same. Thus, check imposed... Right?

why 2 2 for grid? shouldn't it be 1 2?

solution for all the testcase including urs..

for(int k=0;k<=R-r;k++)
 {
       end=c;
       start=0;
       while(end<=C){

          if(G[k].substring(start,end).equals(P[0])){
                    for(int i=1;i<r;i++)
                    {
            if(G[k+i].substring(start,end).equals(P[i]))
                            count++;
                        if(count==r-1)result=true;
                     }                 
          }
                count=0;
                end++;
                start++;
            }

        }
        if(result)
            System.out.println("YES");
        else System.out.println("NO");

    }

This case fails because it is missing the input for "test case #". It should have a 1 on top. 1 4 6 123412 561212 123634 781288 2 2 12 34

my code also fails for this testcase

my code is giving correct ans for this testcase but failing in test case 5

Did you add numeric number 1 at the top of this test case to denote 1 test case..?

my code passes for this but fails for test case #5

Lol you are so mean for having that testcase added! :3 It took me another half hour to try and get my code to work!

Mine passed your test!

Success and Thanks for the test case . I thought it needed sophisticated string matching but it worked without TLE despite using 4 for loops

language:c++11

http://ideone.com/Zj4KMb

My code Passed all the tests cases including the above test case.

In case if it helps:

https://www.hackerrank.com/challenges/the-grid-search/submissions/code/21023645

This input is already included in one of the test cases.

My code works for all test cases, including yours.

private static boolean search(int[][] grid, int[][] pattern) {
    int hGrid = grid.length;
    int wGrid = grid[0].length;
    int hPat = pattern.length;
    int wPat = pattern[0].length;

    int wG = 0;     
    boolean patternCompletelyFound = false;
    while (wG + wPat <= wGrid && patternCompletelyFound == false) {
        boolean matching = false; 
        int hp = 0;
        for (int hG = 0; hG < hGrid; hG++) {
            if (!matching && hGrid - hG < hPat) {
                break;
            }       
            if (hPat == hp) {                    
                break;
            }                
            if (match(grid[hG], pattern[hp], wG) || match(grid[hG], pattern[0], wG) ) {
                hp++;
                matching = true;
            } else {
                matching = false;
                hp = 0;
            }
        }    
        if (matching == true && hPat == hp) {
            patternCompletelyFound = true;
        }            
        wG++;
    }                          
    return patternCompletelyFound;
}

private static boolean match( int[] gridLine, int[] patLine, int wG) {       
    boolean matched = true;        
    for (int i = 0; i<patLine.length; i++) {
        //System.out.println("grid: " + gridLine[i + wG] + " pat: " + patLine[i]);            
        if (patLine[i] != gridLine[i + wG]) {                                                
            matched = false;
            break;
        }
    }        
    return matched;
}

My code passed this test...

public class Solution {

public static boolean calculate(int [][]A,int [][]a,int R,int C,int r,int c,int j,int k){
    if(j+r<=R&&k+c<=C){
        boolean flag = true;
        for(int i1=0;i1<r;i1++){
            for(int i2=0;i2<c;i2++){
                if(A[j+i1][k+i2]!=a[i1][i2]){
                    flag=false;
                    break;
                }
            }
            if(!flag)
                break;
        }
        return flag;
    }
    else
        return false;
}

public static void main(String[] args) {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */
    Scanner in = new Scanner(System.in);
    int t = in.nextInt();
    boolean flag = false;
    for(int i=0;i<t;i++){
        int R = in.nextInt();
        int C = in.nextInt();
        int [][]A = new int[R][C];
        String line;
        for(int j=0;j<R;j++){
            line = in.next();
            for(int k=0;k<C;k++)
                A[j][k]=Character.getNumericValue(line.charAt(k));
        }
        int r = in.nextInt();
        int c = in.nextInt();
        int [][]a = new int[r][c];
        for(int j=0;j<r;j++){
            line = in.next();
            for(int k=0;k<c;k++)
                a[j][k]=Character.getNumericValue(line.charAt(k));
        }
        for(int j=0;j<R;j++){
            for(int k=0;k<C;k++){
                if(A[j][k]==a[0][0])
                    if(calculate(A,a,R,C,r,c,j,k)){
                        flag = true;
                        break;
                }
            }
            if(flag){
                break;
            }
        }
        if(flag)
            System.out.println("YES");
        else
            System.out.println("NO");
    }
}

}

//Works with your example

my code worked perfectly for this test case... but failed for some given test cases.

At first I thought I also must had some logical error in my code that passed all the test cases running this manual test case.

Then I realised this test case is missing the 'T' value of 1 in the input -.- I feel like I got trolled

the code works perfectly fine for me ... here is my code

import java.io.*;
import java.util.*;

public class Solution {

    public static void main(String[] args) {
        int t,x,y,x1,y1;
        Scanner in = new Scanner(System.in);
        String s;
        t=Integer.parseInt(in.nextLine());
        for(int i=0;i<t;i++){
            s = in.nextLine();
            String s1[] = s.split("\\s");
            x1=Integer.parseInt(s1[0]);
            y1=Integer.parseInt(s1[1]);
            
            int a[][] = new int[x1][y1];
            for(int j=0;j<x1;j++){
               s = in.nextLine();
                
               String s3[] = s.split("");
                
                for(int k=0;k<y1;k++){
                    
                    a[j][k]=Integer.parseInt(s3[k]);
                    
         //   System.out.println("j is " + j +" and k is " + k +  " and val is " +a[j][k]);
                }
            }
            s = in.nextLine();
            //System.out.println(s);
            String s2[] = s.split("\\s");
            x=Integer.parseInt(s2[0]);
            y=Integer.parseInt(s2[1]);
            
            int b[][] = new int[x][y];
            for(int j=0;j<x;j++){
                s = in.nextLine();
                String s4[] = s.split("");
                for(int k=0;k<y;k++){
                    b[j][k]=Integer.parseInt(s4[k]);
                }
            }
            int r,c=0,count=y,dup=0,dup1=0,er1=0,er2=0,br=0,crt=0,j1=0,k1=0;
            for(int j=0;j<x1;j++){
                
                for(int k=c;k<y1;k++){
                   // System.out.print("here j is "+j+" and k is "+k + "and y1 is "+ y1);
            //System.out.println(a[j][k]+" and " + b[j1][k1]);
                    
                    if(a[j][k]==b[j1][k1]){
                        
                        //System.out.print("here j1 is "+j1+" and k1 is "+k1 + "and y1 is "+ y1);
                        if(dup1==0)
                        {
                        c=k;
                        er1=j;
                        er2=k;   
                        dup1++;
                        }
                        k1++;
                        if(k1>y)
                            {
                            j1++;
                            k1=0;
                        }
                       dup++;
                        //dup1++;
                    }
                    else{
                        if(dup1!=0){
                        j=er1;
                        k=er2;
                         //   System.out.println("Location Changed ");
                        }
                        dup1=0;
                        dup=0;
                        c=0;
                        crt=0;
                        j1=k1=0;
                    }
                    if(dup==count){
                        //System.out.println("here");
                        crt++;
                        if(crt==x){
                            br=1;
                            break;
                        }
                        dup=0;
                        //dup1=0;
                        j1++;
                        k1=0;
                        break;
                    }
                    
                }
                if(br==1)
                    break;
            }
            if(br==1)
                System.out.println("YES");
            else
                System.out.println("NO");
        }
    }
}

Thanks a lot for this corner case. Cleared all the test cases :)

My code working fine with above testcase too.

My code Passed this TC. :)

int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int t;
    cin>>t;
    while(t--){
        int r1,c1,r2,c2,flag=0;
        cin>>r1>>c1;
        vector<string> s(r1);
        for(int i=0;i<r1;i++) cin>>s[i];
        cin>>r2>>c2;
        vector<string> p(r2);
        for(int i=0;i<r2;i++) cin>>p[i];
        for(int i=0;i<=r1-r2;i++){
            for(int j=0;j<=c1-c2;j++){
                flag=0;
                if(s[i][j]==p[0][0] && s[i].substr(j,c2)==p[0]){
                    int d=i+1,k=1;
                    for(;k<r2;k++){
                        if(s[d++].substr(j,c2)!=p[k]){
                            break;
                        }
                    }
                    if(k==r2){
                        flag=1;
                        break;
                    }
                }
            }
            if(flag==1){
                break;
            }
        }
        if(flag==1){
            cout<<"YES\n";
        }else{
            cout<<"NO\n";
        }
    }
    return 0;
}

no need to add.If u write a perfect code,it will not fail any test case

My code works for this test case too, I think they have added it as test case 7 :)

    filRow = R - r + 1
    filCol = C - c + 1

    for i in range(filRow):
        for j in range(filCol):
            daffuq = []
            for x in range(r):
                daffuq.append(G[i + x][j : j + c])
            if daffuq == P:
                return "YES"
    return "NO"

TLE at TC 5, any suggestions?

my code passed your test case but shows abord called for only test case no 5 .please help me with what is reason for abord called

I don't think the authors need to add any test cases. Part of the challenge is identifying edge cases that your code may fail at. If the authors provide you every test case, what is the point?

it works for me, after i inserted an extra first line "1"

as described in the probelm: the first line contains an integer t , the number of test cases.

If you are checking by rows (columns), you need to make sure that you keep checking after you match the first row (column) but not the rest. Otherwise, you'll miss any case like this.

my code worked for this!!!

my code passed this one.

it should return "YES", right!! Balaji's Submission Check it please. It gives the required answer

When you are checking the horizontal length also check vertical length

beacuse in last row 12 is present but below that matrix ends so test case fails

u saved me!!!

i am sure, if you put 1 as first line (number of test cases) it will pass

i thought its about the internal code, my function has been called yet, might be caused by invalid input test case

the test case you mentioned is working for me fine. OUTPUT : YES

What was it 4 years ago so that you could write a hack to bypass the test cases? Could you post your code?

In my case, my code successfully pass this testcase, as well as all the test cases.

My code worked for the above test case, and all test cases except #5 were passing, was pretty frustrating. Then I removed the boilerplate code, wrote my own and all of a sudden it passed #5, without changing anything else....

That's a really bad thing to have happen, the last place you expect to have to debug is the boilerplate code. Could mess things up big time if it doesn't occur to you that it might be wrong...and you just get more and more frustrated...

problem is with your code dude , my code passes all the test cases and give accurate result for this case too.

This was causing me to tear my hair out because my program failed some of the test cases when I submitted it, but when I looked at that input and copy/pasted it into the "custom test case" textarea the newlines were as expected (only "\n"), so my program always passed the test cases when I ran them one-by-one but always failed when I submitted it.

bantic,

I think I'm running into the same issue here. I've downloaded (or bought) some of the test cases I've failed, but they pass when I run them manually.

Can you provide any guidance to how to do this? How can I strip "\r" in JavaScript?

A mod needs to see this... so much frustration and spending hackos to check test cases manually that all worked anyway.

This really should get fixed! Thanks a lot

I am using my own boilerplate now.

I am also removing empty lines just in case.

process.stdin.setEncoding('utf8');

var input = "";

process.stdin.on("data", function (chunk) {
    input = input + chunk;
});

process.stdin.on("end", function () {
    var lines = input.replace(/\r/g, "").split("\n").filter(function (line) {
        return line.trim();
    });

    // Code here.
});

GAH!! No wonder. Thanks for this! Just added the code to strip the CRs out and now I pass all the tests. To fix it, I updated the split() statement in the boilerplate to use a RegEx:

input_stdin_array = input_stdin.split(/\r?\n/);

Guess I'll have to add that from now on...

Thank you so much!

Thanks, man! Same struggle, seeing correct results on copy/pasted failed test cases.

EDIT: If anybody else finds this annoying, might be helpful to submit a ticket to Support - see link at the bottom of the page. I just did that, hopefully life will get better for us JavaScripters. :)

If you use the dimensions of the string that are passed in instead of walking to the end of the string, you shouldn't have this problem.

Same problem. Wrong answer on #5 after 1.5s. My code checks for alignment and passes all custom cases posted in the discussions. Admins please increase the size limit for custom input.

use test case provided by @vangoor_bharath.It helped me pass test case #5

haha...nice code

pls explain why you have used this: if(k-i+1==r).????

When you break, the code will come out of the while loop and continue in the inner for loop.

You probably need additional breaks in the outter loops to come out completely and return YES.

Thank you bro

Did you check if there's any leading white spaces?

I too facing the same problem. Test cases 9,11 13 and 15 are getting failed despite the correct output.

please share your code , it would be helpful for the beginners.

that's 4 nested loops...

One small improvement....sr to sr-fc and sc to sc-fc for(int i=0;i