InterviewBit Problems   Kth Manhattan Distance Neighbourhood : Solved


About the Kth Manhattan Distance Neighbourhood : Solved category (1)
If you take the 'A' inside 'N*M' loop. A slight different approach! (1)
Easy Manhattan DP solution (1)
Solved without dp. Basic Optimisation by sorting (1)
Lang: C++; Complexity[Time,Space]: [O(k*n*m),O(k*n*m)] (1)
Solution using a temporary 2D vector (1)
Simple C++ 3D DP Solution (1)
Can somone point out the error. It works for small test cases but fails large ones (1)
Segmentation falult (3)
Can improve on editorial space complexity (1)