Can you write the constraints for this problem?
thanks.
Adolfo
2013/5/18 rahul sharma rahul23111...@gmail.com
Minimum of coins to sum s
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To unsubscribe from this group and stop receiving
stack
2012/9/18 Navin Kumar algorithm.i...@gmail.com
Which data structure is used to maintain browser history?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To view this discussion on the web visit
I think that you should use the binary search algorithm
take care
2012/4/25 tech coder techcoderonw...@gmail.com
Given N points(in 2D) with x and y coordinates. You have to find a
point P (in N given points) such that the sum of distances from
other(N-1) points to P is minimum.
--
Can you explain the size of inputs?
I think that Coordinate's Compression can solved this
2012/1/17 UTKARSH SRIVASTAV usrivastav...@gmail.com
read my reply on a post of maximum rectangle yesterday
On 1/17/12, amrit harry dabbcomput...@gmail.com wrote:
sorry for last comment i misunderstand
this problem is solved in O( n^3).
2012/1/16 jaimedp jaim...@gmail.com
Compute the integral matrix, find the min and max in that matrix
(given that min is left and up from the max) and those would be the
top left and bottom right of the max sum matrix.
mmm, I think that works
On
this problem is solved in O(n*s), where n is the size of Array and s is the
sum, the aproach is Dynamic Programming.
2012/1/6 saurabh singh saurab...@gmail.com
@all Yes it is possible to find the solution using 0/1 knapsack.The
approach would be similar as in case of LCS problem when many
Shady ,
how do you valide the case that a, b, c, d are diferente, i.e a=x[i] ,
b=x[j], i!=j ?
2012/1/1 Lucifer sourabhd2...@gmail.com
@ SAMM..
The following might work, but would need verification..
Below solution is for a generic no. of elements.
In your case its 4.
Lets represent 4 by
