# Talk:TADM2E 8.25

From Algorithm Wiki

The problem asks for the solution for maximum contigous sum from index i through j, NOT 0, n. The solution provided is the solution to the general case, not the case specified in the problem