Where is my logic wrong in this dynamic programming problem? I'm trying to solve https://www.hackerrank.com/challenges/summing-pieces and I think I have come up with an O(n) solution although the numbers aren't coming out exactly right. The problem is essentially to find a sum like ABC...
Convex Hull Optimization 3 Problems (No conditions for a[] array and b[] array) : GOODG BOI 2012 Day 2 Balls Cow School Solution-Video → Reply victorsenam 9 years ago, # ^ | ← Rev. 2 0 GOODG can be solved with Type 1 EDIT: I explain that below. → Reply fofao_funk...