Just Crack Interview

Your Ultimate Interview Preparation Resource

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

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

Ques:- 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
0 9574
Back to Previous Page

Leave a Reply

Your email address will not be published. Required fields are marked *

Scroll to top