{"version":"1.0","type":"link","title":"Maximum subarray problem - Newikis","description":"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. It can be solved in time and space.","provider_name":"Newikis","provider_url":"https://newikis.com","cache_age":86400,"thumbnail_url":"https://thumb.wikimedia.org/wikipedia/commons/thumb/2/25/Maximum_Subarray_Visualization.svg/1280px-Maximum_Subarray_Visualization.svg.png","thumbnail_width":1280,"thumbnail_height":960}