Rare card
Maximum subarray problem
- Value
- 50 W
- Attack
- 816
- Defence
- 652
- Players
- 0
In computer science, the maximum sum subarray problem, also known as the maximum segment sum problem, is the task of finding a contiguous subarray with the largest sum, within a given one-dimensional array A[1...n] of numbers.
Get Maximum subarray problem in your collection
Every Wikilord card is a Wikipedia article. Open packs for free, trade, battle and climb the leaderboard.
Open a free pack