you have 2-d array, with m length and n width.You are also given k, ( k<=n && k<=m ). Now, select a square of size k, which returns maximum sum.In Minimum Time Complexity
Thanks & Regards Shashank. -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
