could you please explain why this is knapsack? the problem statement can be modified as follows...
given an array of integers, find the sub-set that add up to a given number... On Dec 29, 2:48 am, suhash <suhash.venkat...@gmail.com> wrote: > Is'nt this just a knapsack problem! > > On Dec 29, 3:45 pm, rajeev kumar <rajeevprasa...@gmail.com> wrote: > > > > > > > > > you are given a string.It may have repeated characters.each character has > > it's own weight.find combination of characters whose sum value is equal to > > given value. > > > ex: given string 'abcbacbabcc' > > weight of each character a-5,b-4,c-6. > > > character combination which gives sum 15 is 'aaa' > > > -- > > Thank You -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
