End Google Ads 201810 - BS.net 01 --> Write an algorithm that take two 2D arrays,,(int[,] a,int[,] b) and cheeks if "a" contains "b"..
//a is [100,100] and b is [20,20]
can you solve this please?!