689. Maximum Sum of 3 Non-Overlapping Subarrays | O(1) space | 2 Approaches | Sliding Window Hard

[@krushna6847]

I got the solution at 6:34 , thank you so much aryan bhai..

[@InWonderland-z2l]

love this!! more please

[@Its_Shubham_Negi]

i knew something was cooking 🔥

[@ARYANMITTAL]

Okay the video can is a bit long, but i bet, no-one will cover O(1) space approach, so if you feel like, you can skip O(1) approach ❤

[@nishantkumarjha4644]

thanks brother. It was really helpfull.

[@AverageIndianDrivers]

aryan sir please bring the solution of 3387 pls

[@ajayc815]

😍😍😍😍😍😍😍😍😍😍😍😍😍

[@gundanarendra3542]

Waiting for your video

[@pranshuatrey]

Maqsad ☠☠

[@shubhamjain1511]

Hey Aryan, How should we approach this problem if instead of selecting 3 subarray, we have to select x number of subarray?? and thanks for providing such detailed solution.

[@shauryasinghal-dt1qg]

Use dynamic programming rec(i, x). - from index i...n whats the max sun i can create by choosing x subarrays of length k.

[@shauryasinghal-dt1qg]

Just try to pick ith index and not pick ith index.

[@prajwalshaw9217]

Which companies have asked this question in the last 6 months and 1 year bhaiya...?..just curious.

[@abhassen1531]

facebook only

[@gamersgame43]

google and meta in last 6

[@sozkaya]

very very long :(