Leetcode 122. Best Time to Buy and Sell Stock II

[@unknownuser8912]

I am a beginner and I used the greedy approach but didn't know it was called greedy approach. Thanks !!

[@aayushagrawal7999]

While solving question i thought the solution might be very big and complex ,but to my surprise it was 'opposite'. Thank you fraz for such an amazing soln.

[@gautambnsl]

Thankyou! Helpful Video.

[@mohammadfraz]

Thanks ☺️

[@kirtisingh7252]

Thank you Fraz , you explained it so well.

[@OnePunchSaga]

thank you for the amazing video

[@dheerjain2884]

Beautifully explained!!!

[@mohammadfraz]

Thanks bro

[@ChristForAll-143]

@@mohammadfraz +1

[@AshishSingh-ez8tn]

U explained it so well..thankuu

[@dheerjain2884]

Hey, so I tried this problem from the DSA Sheet. I was able to come up with a solution in O(n) Time, O(1) Space using dynamic programming. Do I save it for round2 of the sheet(if i did not come up with a greedy approach but time complexity and space is optimal)? My main doubt is that: if I am able to come up with most optimal approach in terms of time and space (DP) but there exists another approach(greedy in this case) with same performance, Should I chop out of the sum from the sheet or keep it for round2?

[@mohammadfraz]

Interviewers expect the greedy way as well

[@ratnasanjay]

Thankyou bhaiya for this session

[@ruhinapatel6530]

Very good solution

[@siddharthmehta4223]

fucking awesome

[@shivarajhalageri2513]

What about i-1th element of the array, for the first element

[@abhiimali]

thank you 💗

[@mohdsaadalikhan7209]

nice explanation

[@renukach7927]

@Fraz Which editor are you using?

[@srinish1993]

public int maxProfit(int[] prices) {
int profit = 0;
for(int i=1; i

[@mihirit7137]

i=0
profit=0
N=(len(prices))-1
while(iprices[i]:
profit=profit+prices[i+1]-prices[i]
return profit
i tried to code this logic in python however it isnt exceuting could someone help why ?

[@mathimagery]

net_profit = 0
for idx in range(1, len(prices)):
if prices[idx] > prices[idx-1]:
net_profit += prices[idx] - prices[idx-1]
return net_profit

[@ruhinapatel6530]

This is kadane's algo..

[@amanahmed6057]

bhai sheet ke saare question par banaao plzzzzzzzzzzzz bhai

[@KishanKumar-zi5dp]

Plzz provide java solution..

[@N451M4K]

class Solution {
public int maxProfit(int[] prices) {
int net_profit=0;
for(int i=1; i