Hello there!
Today we are going to be diving into one of the most classic algorithmic problems we face when learning how to code: the Maximum Subarray Sum problem.
This problem is the perfect excuse for me to introduce you to the Divide & Conquer paradigm and it will serve as a very complete example of how to optimize for memory and time when creating a solution.
At the end of the post, you will find some algorithmic challenges so you can try and apply some of the topics that I will explain today. Feel free to skip to that part if you think you already have the necessary skills to solve them.
Let’s begin!
