Amazon & Apple Interview Problem

[@gamesx8528]

Bro this is giving me anxiety

[@lOmaine777]

Is this the one they call Kadane's algorithm or something

[@messiisthebest]

Yes

[@soumyadeepdas770]

This video has subtitles available.

[@jeromelawrence9819]

Using sliding windows algorithm is much easier

[@TF2Shows]

it wont work with negative numbers

[@waidenf]

thats for fixed lengths genius.

[@ahmadramadhan9043]

u can using prefix sum and make variable to save the minimum prefix sum and then every index you check if the current prefix minus minimum prefix before

[@prabhatjha653]

Nice, thought of the same solution, but didn’t know this is the famous Kadane’s algorithm, I always hear this name but didn’t knew. Thanks

[@rohitgarg3942]

Two pointers/sliding window

[@jackybanh8105]

the issue with your solution, you memorised a specific algorithm to solve the question optimally. this is not the point of the coding interview, its literally a proxy on how you approach the answer not memorising a technique

[@user-qs1lh1qv1d]

what colour is your lamborgini?

[@sathwikreddy175]

By currentmax will point at arr[0] and add arr[1] and check cuurentmax is less than or greater than arr[i] and update it to max sofar the highest values ant iterate

[@Manoharofficial180]

Why your solving the question in python

[@boomer698]

is he speaking english cuz i dont understand a word😢

[@jonathanjohnson2785]

He has an accent but I understand him perfectly. Very helpful Sahil❤

[@ahmadabid7845]

What if we devise the array into two other arrays negative and positive and we just add up the positive array but this doesn't match the example ig is that ok?

[@LikemyCommentt]

It should be continuous

[@Vivek-ru9vd]

we can do it by brute force

[@ForgottenKnight1]

It's funny how the first example is wrong - the largest subarray would be [1,4,2,1,4] - why ? because nowhere in that requirement is there any specifications about not dismissing duplicates. Also, why would you choose e negative number that will decrease your sum? That's just dumb, imho. Even [4,2,1] would have been a better option. Who makes these problems ? :)))

[@sahilandsarra]

If only you could do one Google search

[@shantanushekharsjunerft9783]

Isn’t 1,4,2,1,4 the subarray with largest sum?

[@Shhhh-ni5jw]

That’s a subsequence

[@gunabaki7755]

A subarray should contain only contiguous elements, not just random nums from array

[@entertainercartoons]

​@@Shhhh-ni5jw can you explain that

[@ForgottenKnight1]

@@Shhhh-ni5jw An array is a collection, and can contain one or more elements, or none, in any order, with duplication or without. What are you talking about?

[@SOSSVT]

Do they impose a language or you could solve the problem with any coding language?

[@snehalpatil7528]

Any language is fine

[@user-fc6wv1wy7e]

@@snehalpatil7528 wait so like they would give you this problem and you would try and solve it on any programming language or you have to use your brain to solve it

[@rohhanbhardwaj]

​​​@@user-fc6wv1wy7ebro any language works

[@aquibchishti8503]

this is brain f 😮🎉😢

[@lisiasty688]

Can't we just try add number and if number lowers sum then revert this? For every number in array And then not reverted numbers will be just numbers than are not in subarray I think it would be O(n)

[@hapfsunion017]

1st comment 😂