{"id":22513665,"url":"https://github.com/emahtab/maximum-subarray-sum","last_synced_at":"2025-10-14T01:04:27.409Z","repository":{"id":79525629,"uuid":"224482744","full_name":"eMahtab/maximum-subarray-sum","owner":"eMahtab","description":"Find the maximum contiguous subarray sum","archived":false,"fork":false,"pushed_at":"2022-04-15T11:11:48.000Z","size":12,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-10-14T01:04:24.163Z","etag":null,"topics":["kadane-algorithm","leetcode","problem-solving"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/eMahtab.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null,"notice":null,"maintainers":null,"copyright":null,"agents":null,"dco":null,"cla":null}},"created_at":"2019-11-27T17:24:43.000Z","updated_at":"2022-10-05T11:35:05.000Z","dependencies_parsed_at":"2023-05-10T17:15:28.983Z","dependency_job_id":null,"html_url":"https://github.com/eMahtab/maximum-subarray-sum","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/eMahtab/maximum-subarray-sum","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eMahtab%2Fmaximum-subarray-sum","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eMahtab%2Fmaximum-subarray-sum/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eMahtab%2Fmaximum-subarray-sum/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eMahtab%2Fmaximum-subarray-sum/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/eMahtab","download_url":"https://codeload.github.com/eMahtab/maximum-subarray-sum/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/eMahtab%2Fmaximum-subarray-sum/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279017456,"owners_count":26086080,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","status":"online","status_checked_at":"2025-10-13T02:00:06.723Z","response_time":61,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["kadane-algorithm","leetcode","problem-solving"],"created_at":"2024-12-07T03:13:57.316Z","updated_at":"2025-10-14T01:04:27.404Z","avatar_url":"https://github.com/eMahtab.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Maximum Contiguous Subarray Sum (Kadane's Algorithm)\n## https://leetcode.com/problems/maximum-subarray\n\nGiven an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.\n\nA subarray is a contiguous part of an array.\n```\nExample 1:\n\nInput: nums = [-2,1,-3,4,-1,2,1,-5,4]\nOutput: 6\nExplanation: [4,-1,2,1] has the largest sum = 6.\n```\n\nFor array [-2, 1, -3, 4, -1, 2, 1, -5, 4] the maximum contiguous subarray sum is 6 [4, -1, 2, 1]\n\n**More examples :**\n```\n[-1, 1]  =\u003e Max Contiguous Subarray sum is 1\n[-1, 1, 2, -1, 2]  =\u003e Max Contiguous Subarray sum is 4 [1, 2, -1, 2]\n```\n\n## This is a beautiful question 😲\n\nWe can use the Kadane's algorithm to find the maximum contiguous subarray sum in just one iteration through the input array.\n\n```java\nclass Solution {\n    public int maxSubArray(int[] nums) {\n        if(nums == null || nums.length == 0)\n            return 0;\n        \n        int maxSum = nums[0];\n        int currentMax = nums[0];\n        for(int i = 1; i \u003c nums.length; i++){\n            currentMax = Math.max(nums[i], nums[i]+currentMax);\n            maxSum = Math.max(maxSum, currentMax);\n        }\n        return maxSum;\n    }\n}\n\n```\n\n```\nRuntime Complexity : O(n)\nSpace Complexity   : O(1)\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Femahtab%2Fmaximum-subarray-sum","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Femahtab%2Fmaximum-subarray-sum","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Femahtab%2Fmaximum-subarray-sum/lists"}