@praveen.. Great/Elegant observation.. :)
On Jan 2, 2:40 pm, praveen raj <[email protected]> wrote: > this is like a DP problem to me.... > > 1) build a 2 D array . > 2) store If difference b/w any two number is <= K then M[i,j]=1 > else M[i,j]=0 > 3) Now find max size square (containing all ones) by using Dynamic > Programming. > > PRAVEEN RAJ > DELHI COLLEGE OF ENGINEERING -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
