isnt it is similar to coin change problem , here we need minimum
number of stamps to form a value.
so we can check which number exceed the min stamp range i.e 1 to 3.
On Jun 19, 11:55 am, sanjay pandey sanjaypandey...@gmail.com wrote:
The postage stamp problem is a mathematical riddle that asks
how to find all cut vertexes in a given graph ??
--
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
@Lucifier:
i guess you made some editing mistake :-
Initialize the array with the following values,
1) A[0, j] = 0 for 1 = j = Wmax
2) A[i, 0] = 1 for 0 = i = Wmax // it shoud be 1 for 0 = i =N
about this equation :-
A[i , j] = A[i-1, j] | A[ i-1 , j - W[i] ]
say if W[i]=10 and j=3 , i
Given a string of length N, find whether there exits an even length
palindrome substring.
what would be efficient way of solving this problem.?
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
If you want to instant search a contact number of person from a phone
book.
one must be able to use any one of them to search(person name or
contact number).
for eg : given phone number as input it should return name of the
person
or
given name of the person as input it should return phone
Assume that there are n numbers (some possibly negative) on a circle,
and
we wish to find the maximum contiguous sum along an arc of the circle.
Give an
efficient algorithm for solving this problem.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks
