It's Over Solve this jeetcode question without using Google or chatgpt

[pointless Existence]

Given an integer array nums, find the subarray with the largest sum and return it's sum
ex:nums = [-2,1,-3,4,-1,2,1,-5,4]
Output : 6 ,subarray= [4,-1,2,1]

def maxsum(nums:List[int]) -> int:

 

[Pancakecel]

Sorry sweaty, you're not entitled to help with your homework

 

[Acorn]

I'm not a cooder

 

[pointless Existence]

Sorry sweaty, you're not entitled to help with your homework

Not a homework lol what kind of retard asks homework questions.its like that math thread trying to ascend started for mathcels

 

[CRASH THE CUCK]

6

 

[lnceI]

I dont know what that means

 

[Lifeless]

I dont know what that means

Same

 

[pointless Existence]

6

Absolutely right

 

[AsiaCel]

Given an integer array nums, find the subarray with the largest sum and return it's sum
ex:nums = [-2,1,-3,4,-1,2,1,-5,4]
Output : 6 ,subarray= [4,-1,2,1]

def maxsum(nums:List[int]) -> int:

I don't know python syntax, and I assume you can't use APIs.

I assume you can create a global array.

For every loop, see if the current number is bigger than your previous number, if it is, then it becomes the newPos.

The newPos will stop updating at index 3, because, nothing else is bigger than 4.

Then do the rest of it. I'm too lazy to think through it and I don't know what is subsrray supposed to be in, in this question

 

[pointless Existence]

I don't know python syntax, and I assume you can't use APIs.

I assume you can create a global array.

For every loop, see if the current number is bigger than your previous number, if it is, then it becomes the newPos.

The newPos will stop updating at index 3, because, nothing else is bigger than 4.

Then do the rest of it. I'm too lazy to think through it and I don't know what is subsrray supposed to be in, in this question

you iterate through the array and keep a temp variable for current sum till a position and when the sum drops below 0 start newsum and compare all cursum and return the maximum. I really didnt understood your solution though

 

[Marsa243]

sort numbers in descending order and keep making arrays with size increasing by 1 until it hits the size of the initla array, starting at 1 until the next array sum is smaller than the last and return the sum of the last array or return last array if it loops over the whole thing (dont know if this will work)

 

[pointless Existence]

sort numbers in descending order and keep making arrays with size increasing by 1 until the next array is smaller than the last and return the sum of the last array

subarray means contiguous numbers if you sort them the order will be lost. I also thought of sorting when i first saw the question

 

[pointless Existence]

@Master can i do internship at .is it will increase my chances of getting an IT job

 

[Retardfuel]

I'm not a chink

 

[Marsa243]

subarray means contiguous numbers if you sort them the order will be lost. I also thought of sorting when i first saw the question

i thought the order doesnt matter since the sum will be the same regardless of the order unless you are explicitly forced to find subarrays in this problem even though my approach will produce the same output

EDIT: ok so if you want to return both the subarray and its sum then u can cache the number positions from the original array and then bring them back in the largest sorted array that lost order (i dont know if this is gonna work lol)

 

[pointless Existence]

i thought the order doesnt matter since the sum will be the same regardless of the order unless you are explicitly forced to find subarrays in this problem even though my approach will produce the same output

oh probably i didn't understood it can you write a pseudo code maybe

 

[Marsa243]

oh probably i didn't understood it can you write a pseudo code maybe

nevermind the order must be preserved otherwise its a different problem