---
title: "Discussion on \"Maximum Subarray Sum\" | Hashnode"
description: "Discussion on \"Maximum Subarray Sum\". Given an array of integers, our motive is to find the sum of contiguous subarray of numbers having  the largest sum.\nThe subarrays are continuous ie unlike subsequences or subsets, elements can't be skipped in between. \nIf all the elements are positi..."
url: "https://hashnode.com/posts/kadanes-algorithm/5fd5079ef60e3973bae6b57e"
---

[Feed](https://hashnode.com/feed) /

Discussion

# [Maximum Subarray Sum](https://vineethm.hashnode.dev/kadanes-algorithm?utm_source=hashnode&utm_medium=feed)

Given an array of integers, our motive is to find the sum of contiguous subarray of numbers having the largest sum. The subarrays are continuous ie unlike subsequences or subsets, elements can't be skipped in between. If all the elements are positi...

Dec 12, 2020 · 6 min read · vineethm.hashnode.dev  
Updated Apr 27, 2021  
Read the article

-   [#competitive-programming](https://hashnode.com/tag/competitive-programming)
-   [#cpp](https://hashnode.com/tag/cpp)

## Written by

[M.Vineeth](https://hashnode.com/@vineethm1627)

@vineethm1627 · India

  
[View profile](https://hashnode.com/@vineethm1627)

Data Structures and Algorithms 💯

## Responses

Markdown supported · ⌘↵ to post

No responses yet.