{"id":2196,"date":"2024-09-11T11:01:54","date_gmt":"2024-09-11T11:01:54","guid":{"rendered":"http:\/\/waqar-arshad.com\/?p=2196"},"modified":"2024-09-11T11:01:57","modified_gmt":"2024-09-11T11:01:57","slug":"maximum-subarray-sum","status":"publish","type":"post","link":"http:\/\/waqar-arshad.com\/index.php\/2024\/09\/11\/maximum-subarray-sum\/","title":{"rendered":"Maximum Subarray Sum"},"content":{"rendered":"
\r\n
\r\n \r\n <\/i>\r\n <\/a>\r\n <\/span>\r\n<\/div>
\r\n \r\n <\/i>\r\n <\/a>\r\n <\/span>\r\n<\/div><\/div>\n
\n

Input: <\/strong>arr[] = {2, 3, -8, 7, -1, 2, 3}
Output:<\/strong> 11
Explanation: <\/strong>The subarray {7, -1, 2, 3} has the largest sum 11.<\/p>\n\n\n\n

Input: <\/strong>arr[] = {-2, -4}
Output: \u2013<\/strong>2
Explanation: <\/strong>The subarray {-2} has the largest sum -2.<\/p>\n\n\n\n

Input: <\/strong>arr[] = {5, 4, 1, 7, 8}
Output:<\/strong> 25
Explanation:<\/strong> The subarray {5, 4, 1, 7, 8} has the largest sum 25.<\/p>\n<\/blockquote>\n\n\n\n

\/\/ C# Program to find the maximum subarray sum using nested loops<\/p>\n\n\n\n

using System;<\/p>\n\n\n\n

class GfG {<\/p>\n\n\n\n

\/\/ Function to find the sum of subarray with maximum sum\nstatic int MaxSubarraySum(int[] arr) {\n    int res = arr[0];\n\n    \/\/ Outer loop for starting point of subarray\n    for (int i = 0; i < arr.Length; i++) {\n        int currSum = 0;\n\n        \/\/ Inner loop for ending point of subarray\n        for (int j = i; j < arr.Length; j++) {\n            currSum = currSum + arr[j];\n\n            \/\/ Update res if currSum is greater than res\n            res = Math.Max(res, currSum);\n        }\n    }\n    return res;\n}\n\nstatic void Main() {\n    int[] arr = {2, 3, -8, 7, -1, 2, 3};\n    Console.WriteLine(MaxSubarraySum(arr));\n}<\/code><\/pre>\n\n\n\n
}<\/p>\n","protected":false},"excerpt":{"rendered":"
Input: arr[] = {2, 3, -8, 7, -1, 2, 3}Output: 11Explanation: The subarray {7, -1, 2, 3} has the largest sum 11. Input: arr[] = {-2, -4}Output: \u20132Explanation: The subarray {-2} has the largest sum -2. Input: arr[] = {5, 4, 1, 7, 8}Output: 25Explanation: The subarray {5, 4, 1, 7, 8} has the largest sum 25. \/\/ C# Program to find the […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"_uag_custom_page_level_css":"","site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"default","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-opacity":"","overlay-gradient":""}},"footnotes":""},"categories":[1],"tags":[],"class_list":["post-2196","post","type-post","status-publish","format-standard","hentry","category-uncategorized"],"uagb_featured_image_src":{"full":false,"thumbnail":false,"medium":false,"medium_large":false,"large":false,"1536x1536":false,"2048x2048":false},"uagb_author_info":{"display_name":"admin","author_link":"http:\/\/waqar-arshad.com\/index.php\/author\/waqar_29_1\/"},"uagb_comment_info":44,"uagb_excerpt":"Input: arr[] = {2, 3, -8, 7, -1, 2, 3}Output: 11Explanation: The subarray {7, -1, 2, 3} has the largest sum 11. Input: arr[] = {-2, -4}Output: \u20132Explanation: The subarray {-2} has the largest sum -2. Input: arr[] = {5, 4, 1, 7, 8}Output: 25Explanation: The subarray {5, 4, 1, 7, 8} has the largest sum 25. \/\/ C# Program to find the…","_links":{"self":[{"href":"http:\/\/waqar-arshad.com\/index.php\/wp-json\/wp\/v2\/posts\/2196","targetHints":{"allow":["GET"]}}],"collection":[{"href":"http:\/\/waqar-arshad.com\/index.php\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"http:\/\/waqar-arshad.com\/index.php\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"http:\/\/waqar-arshad.com\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"http:\/\/waqar-arshad.com\/index.php\/wp-json\/wp\/v2\/comments?post=2196"}],"version-history":[{"count":1,"href":"http:\/\/waqar-arshad.com\/index.php\/wp-json\/wp\/v2\/posts\/2196\/revisions"}],"predecessor-version":[{"id":2197,"href":"http:\/\/waqar-arshad.com\/index.php\/wp-json\/wp\/v2\/posts\/2196\/revisions\/2197"}],"wp:attachment":[{"href":"http:\/\/waqar-arshad.com\/index.php\/wp-json\/wp\/v2\/media?parent=2196"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"http:\/\/waqar-arshad.com\/index.php\/wp-json\/wp\/v2\/categories?post=2196"},{"taxonomy":"post_tag","embeddable":true,"href":"http:\/\/waqar-arshad.com\/index.php\/wp-json\/wp\/v2\/tags?post=2196"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}