Closed nik132-eng closed 3 years ago
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
A subarray is a contiguous part of an array.
https://leetcode.com/problems/maximum-subarray/
Array
@nik132-eng, Kindly go through the probable folders of the repository to check if this has already been addressed.
ok sir
Enter your question -
Given an integer array nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.
A subarray is a contiguous part of an array.
Enter link to the question(if question belongs to any online platform) -
https://leetcode.com/problems/maximum-subarray/
Tags for the question(eg - Array, Basic, Stack, etc.) -
Array