MEDIA.NET Round 2 || oncampus
Anonymous User
487

Question : - you are given a n x m matrix with all +ve values in it . You are give a value k , find whether any square submatrix has sum k or not ?
i did it in O(nxmlog(min(n,m))) but they wanted a O(nm soln) can anyone tell the more optmised soln .

Comments (3)