Problem Statement
Given a 2D array of digits, try to find the location of a given 2D pattern of digits. For example, consider the following 2D matrix:
1234567890
0987654321
1111111111
1111111111
2222222222
Assume we need to look for the following 2D pattern:
876543
111111
111111
If we scan through the original array, we observe that the 2D pattern begins at the second row and the third column of the larger grid (the 8 in the second row and third column of the larger grid is the top-left corner of the pattern we are searching for).
So, a 2D pattern of P digits is said to be present in a larger grid G, if the latter contains a contiguous, rectangular 2D grid of digits matching with the pattern P, similar to the example shown above.
Input Format
The first line contains an integer, T, which is the
number of test cases. T test
cases follow, each having a structure as described below:
The first line contains two space-separated integers, R and C, indicating
the number of rows and columns in the grid G, respectively.
This is followed by R lines,
each with a string of C digits,
which represent the grid G.
The following line contains two space-separated integers, r and c, indicating
the number of rows and columns in the pattern grid P.
This is followed by r lines,
each with a string of c digits,
which represent the pattern P.
Constraints
1≤T≤5
1≤R,r,C,c≤1000
1≤r≤R
1≤c≤C
Test Case
Generation
Each individual test case has been generated by first specifying the size (R and C) of the large
2D matrix, and then randomly generating the digits in it. A limited number of
digits in the larger matrix may be changed by the problem setter (no more than
5% of the total number of digits in the matrix). So the larger 2D matrix is
almost-random. The pattern matrix has been manually-curated by the problem
setter.
Output Format
Display 'YES' or 'NO', depending on whether (or not) you find that the larger
grid G contains the rectangular pattern P. The
evaluation will be case sensitive.
Sample Input
210 1072834558646731158619898824264338305893242229505813563384537464735302937053106601083428295646079241373 495053845353015 154004535921265601142131330986924743860828796485223569511891698871094504874962528026333887825027714849667480759752076937805117997895628064040074542725045490438099160809624108095348114458935237334757687053032141746506292708871602 29999Sample Output
YESNOExplanation
The first test in the input file is:
10 1072834558646731158619898824264338305893242229505813563384537464735302937053106601083428295646079241373 4950538453530As one may see, the given 2D grid is indeed present in the larger grid, as marked in bold below.
7283455864
6731158619
8988242643
3830589324
2229505813
5633845374
6473530293
7053106601
0834282956
4607924137
The second test in the input file is:
15 154004535921265601142131330986924743860828796485223569511891698871094504874962528026333887825027714849667480759752076937805117997895628064040074542725045490438099160809624108095348114458935237334757687053032141746506292708871602 29999The search pattern is:
9999This cannot be found in the larger grid.
Template for solution C# file:
using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
class Solution {
static void Main(String[] args) {
int t = Convert.ToInt32(Console.ReadLine());
for(int a0 = 0; a0 < t; a0++){
string[] tokens_R = Console.ReadLine().Split(' ');
int R = Convert.ToInt32(tokens_R[0]);
int C = Convert.ToInt32(tokens_R[1]);
string[] G = new string[R];
for(int G_i = 0; G_i < R; G_i++){
G[G_i] = Console.ReadLine();
}
string[] tokens_r = Console.ReadLine().Split(' ');
int r = Convert.ToInt32(tokens_r[0]);
int c = Convert.ToInt32(tokens_r[1]);
string[] P = new string[r];
for(int P_i = 0; P_i < r; P_i++){
P[P_i] = Console.ReadLine();
}
}
}
}