RomeoFantastik's blog

Maximum Sum Sub-array — Partial Sums Approach (With Implementation)
By RomeoFantastik, history, 5 years ago, In English

Solving another classic: the Maximum sum sub-array problem.

I am amazed to find out how many of you guys have solved this question, but only so few know the approach using partial sums.

This video is for you!

Also, throwback to those amazing times I was shooting my "Bible of Coding Interviews and Competitive Programming" on the whiteboard from student dorm room.

More to come, Andy

  • Vote: I like it
  • +29
  • Vote: I do not like it

Comments Comments (3)
| Write comment?
»
5 years ago, # |
  Vote: I like it +3 Vote: I do not like it

nice explanation. Thank You

→ Reply
»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Very nice explanation Learnt new approach for solving Kadane's algorithm

→ Reply
»
5 years ago, # |
  Vote: I like it +5 Vote: I do not like it

But, do you know how to solve it with Divide and Conquer approach?

→ Reply