The Sum of the difference in the Subset containing the K elements
must be minimum...
As in above example {9,5,2,6,3,11} where K=3
In case of {2,3,5}
3-2=1
5-3=2
sum of the difference is 3...In all other subsets we cant have sum of
the difference less than 3...so {2,3,5} is the required answer.
On Nov 19, 10:03 am, shady <[email protected]> wrote:
> what do you mean by difference among them ?
> do we need to select the elements to minimize the sum between
> consecutive elements ? or only the first and last element ?
>
> On Nov 18, 6:30 pm, Zyro <[email protected]> wrote:
>
> > Q: Select the K elements in an array of size N which are having the
> > minimum difference among them?
> > For Example : If you have an array like arr[]={9,5,2,6,3,11} and value
> > of K is 3. Then ans would be {2,3,5}.
--
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.
