Hello,
i found this question online and its solution tooBut i am not able to
fully understand the solution.Need your help to proof correctness of the
algo.
Question is as follows :-
*Question:*
*Given an array A and a number S', provide an efficient algorithm (nlogn)
to find a number K suc
@don : According to question we want to find "the maximum subsquare".
can you give me test case for which this wont work?
On Fri, Mar 28, 2014 at 9:41 PM, Don wrote:
> No, that is not the same.
> It won't find a square smaller than s.
> Don
>
>
> On Thursday, March 27, 2014 2:56:29 AM UTC-4,
