LeetCode Next Greater Element II Solution Explained - Java

[@NithishKumar-se9ev]

good explanation but I dont think map will work in this case because the nums array contains duplicates and same numbers may have different next greater elements

[@avneetsng]

the moment you said we will push index , solution clicked my mind . Thanks man

[@Ben-pb7ct]

What is the reason we push i to the stack in the condition if(i < n) ?

[@ritik7906]

u are accessing(arr[i]) in that part

[@jyothi9082]

Thanks buddy! LC solution was incomprehensible

[@DEEPAKGOYALnullRA]

solution is too much confusing i got but still ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;

[@shritishaw7510]

vector nextGreaterElements(vector& v) { vector res; int n = v.size(); for(int j = 0;j

[@ahmetokur6983]

Dude, I forgot everything I learnt so far😁

[@anmolkarki5248]

haha. just have more practice you will get it.

[@sohamdharap4789]

i can feel you! same happened with me when i tried to implement this solution on my own😮‍💨

[@shritishaw7510]

2:29 clicked me, thanks a lot pal

[@ericnatelson2839]

8:07 is where it clicked for me

[@sydneystriker5355]

Man. This problem is so hard not intuitive. Anyway thanks for the clear explanation.

[@rjkal]

You could’ve explained with a diagram first and then jumped to the code. Then you wouldn’t have had such a hard time explaining the code with all the indices.

[@lonelygirlz]

looks similar to shift problem (A+A) contains B

[@stone8905]

Good. Thanks how many hours did you spend to this problem?

[@jugsma6676]

20 minutes

[@farazahmed7]

@@jugsma6676 Ding Dong Ling Long Steve Cold Ayeeeeeeee

[@sallamtanna742]

two days hehehhee

[@aravindhravi2307]

Gr8 explanation Nick! better than LC

[@sankethb.k642]

Nice explaination. thank you

[@surajmaity6194]

Thanks man

[@phungtruong6698]

I got it. Thank you