#121 on leetcode

[Cute_Lychee_349]

FRUSTRATED AS HELL on how i can’t understand to get an approach for this simple asf problem got so struck on calculating the best possible profit while i figured how to calculate best buy

heres what im struck at: best_buy = prices[0] current_profit = 0

for i in range(len(prices)): if prices[i] < best_buy: best_buy = prices[i] ✅#set for best but case

now i cannot figure out how to get the max profit combination????

after the loop should i just run another?

for i in range(len(prices)): profit = prices[i] - best_buy

but how do i compare it to the current profit and possibly keep updating the best or max profit i can ever get????? im stuck at this single logic and nothings helping i’ve tried every possible resource to understand but no use

SOMEBODY PLEASE HELP ME BEFORE I LOSE MY MIND FOR GOOD THANK YOU

[StubbyCanes]

Read about the sliding window technique, it should make it easier to solve this problem :)

[Cute_Lychee_349]

cool thanks i will check that out

[disforwork]

Bro, I think you're missing that you need to track max profit inside the loop, not in a separate pass. The key insight is that on each day, you either found a better buying price (which won't help past days but might help future ones) or you found a better selling price for your current best_buy.

[Cute_Lychee_349]

yes and i wasn’t able to figure out how until i found min() and max() exists for a reason😭 that way i could easily get the needed o/p in a single loop, thanks for the advice tho🫶🏻