feat: adds the-grid-search

Author: ddebin

challenges/medium/the-grid-search/the-grid-search-00.input

@@ -0,0 +1,35 @@
+2
+10 10
+7283455864
+6731158619
+8988242643
+3830589324
+2229505813
+5633845374
+6473530293
+7053106601
+0834282956
+4607924137
+3 4
+9505
+3845
+3530
+15 15
+400453592126560
+114213133098692
+474386082879648
+522356951189169
+887109450487496
+252802633388782
+502771484966748
+075975207693780
+511799789562806
+404007454272504
+549043809916080
+962410809534811
+445893523733475
+768705303214174
+650629270887160
+2 2
+99
+99

challenges/medium/the-grid-search/the-grid-search-00.output

@@ -0,0 +1,2 @@
+YES
+NO

challenges/medium/the-grid-search/the-grid-search-01.input

@@ -0,0 +1,62 @@
+2
+20 20
+34889246430321978567
+58957542800420926643
+35502505614464308821
+14858224623252492823
+72509980920257761017
+22842014894387119401
+01112950562348692493
+16417403478999610594
+79426411112116726706
+65175742483779283052
+89078730337964397201
+13765228547239925167
+26113704444636815161
+25993216162800952044
+88796416233981756034
+14416627212117283516
+15248825304941012863
+88460496662793369385
+59727291023618867708
+19755940017808628326
+7 4
+1641
+7942
+6517
+8907
+1376
+2691
+2599
+25 25
+7652157548860692421022503
+9283597467877865303553675
+4160389485250089289309493
+2583470721457150497569300
+3220130778636571709490905
+3588873017660047694725749
+9288991387848870159567061
+4840101673383478700737237
+8430916536880190158229898
+8986106490042260460547150
+2591460395957631878779378
+1816190871689680423501920
+0704047294563387014281341
+8544774664056811258209321
+9609294756392563447060526
+0170173859593369054590795
+6088985673796975810221577
+7738800757919472437622349
+5474120045253009653348388
+3930491401877849249410013
+1486477041403746396925337
+2955579022827592919878713
+2625547961868100985291514
+3673299809851325174555652
+4533398973801647859680907
+5 4
+5250
+1457
+8636
+7660
+7848

challenges/medium/the-grid-search/the-grid-search-01.output

@@ -0,0 +1,2 @@
+NO
+YES

challenges/medium/the-grid-search/the-grid-search-07.input

@@ -0,0 +1,9 @@
+1
+4 6
+123412
+561212
+123634
+781288
+2 2
+12
+34

challenges/medium/the-grid-search/the-grid-search-07.output

@@ -0,0 +1 @@
+YES

challenges/medium/the-grid-search/the-grid-search-09.input

@@ -0,0 +1,11 @@
+1
+5 15
+111111111111111
+111111111111111
+111111011111111
+111111111111111
+111111111111111
+3 5
+11111
+11111
+11110

challenges/medium/the-grid-search/the-grid-search-09.output

@@ -0,0 +1 @@
+YES

challenges/medium/the-grid-search/the-grid-search-v1.py

@@ -0,0 +1,73 @@
+#!/usr/bin/env python3
+
+import sys
+import os
+
+#
+# Complete the 'gridSearch' function below.
+#
+# The function is expected to return a STRING.
+# The function accepts following parameters:
+#  1. STRING_ARRAY G
+#  2. STRING_ARRAY P
+#
+
+def gridSearch(G: list[str], P: list[str]) -> str:
+    """
+    Returns a string("YES", "NO") if pattern P has been found in G.
+
+    Arguments:
+    G – the grid to search
+    P – the pattern to search for
+    """
+    p = P[0]
+    for i in range(len(G) - len(P) + 1):
+        start = 0
+        while True:
+            start = G[i].find(p, start)
+            if start == -1:
+                break
+            found = True
+            for j in range(1, len(P)):
+                if G[i + j][start : start + len(p)] != P[j]:
+                    found = False
+                    break
+            if found:
+                return 'YES'
+            start += 1
+    return 'NO'
+
+if __name__ == '__main__':
+    if "FOO" in os.environ:
+        fptr = open(os.environ['OUTPUT_PATH'], 'w')
+    else:
+        fptr = sys.stdout
+
+    t = int(input().strip())
+
+    for t_itr in range(t):
+        first_multiple_input = input().rstrip().split()
+
+        R = int(first_multiple_input[0])
+        C = int(first_multiple_input[1])
+
+        G = []
+        for _ in range(R):
+            G_item = input()
+            G.append(G_item)
+
+        second_multiple_input = input().rstrip().split()
+
+        r = int(second_multiple_input[0])
+        c = int(second_multiple_input[1])
+
+        P = []
+        for _ in range(r):
+            P_item = input()
+            P.append(P_item)
+
+        result = gridSearch(G, P)
+
+        fptr.write(result + '\n')
+
+    fptr.close()