if there is a matrix A of order m and another matrix B of order n such that (m>n) you have to find the occurrence of matrix B in matrix A.
A=1,2,3,4,5 5,4,1,9,7 2,1,7,3,4 6,4,8,2,7 0,2,4,5,8 B=1,9,7 7,3,4 8,2,7
This matrix B exist in A.
I can do it by sliding window algo TC O(p^2*n^2) where p = m-n+1. but I want to do this with minimum time complexity.