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/explore/interview/card/top-interview-questions-easy/97/dynamic-programming/566/

Tags for the question(eg - Array, Basic, Stack, etc.) -

dynamic programming,kadane's algorithm