Given a matrix M of size nxm and an integer K, find the maximum element in the K manhattan distance neighbourhood for all elements in nxm matrix.
In other words, for every element M[i][j] find the maximum element M[p][q] such that
abs(i-p)+abs(j-q) <= K.
Note: Expected time complexity is O(N*N*K)
1 <= n <= 300 1 <= m <= 300 1 <= K <= 300 0 <= M[i][j] <= 1000
Input: M = [[1,2,4],[4,5,8]] , K = 2 Output: ans = [[5,8,8],[8,8,8]]
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.