Candy | Leetcode June Challenge | Leetcode 135 | Approach + Code | C++ | Python | Hindi

C++ Code Link : github.com/Ayu-99/Data-Struct...
Python Code Link: github.com/Ayu-99/Data-Struct...
Please like, share and subscribe if you found the video useful. Feel free to ask in comments section if you have any doubts. :)
#leetcode
#leetcodeJuneChallenge
#interviewpreparation
Candy solution
Candy Leetcode
Candy C++
Candy C++ Hindi
Candy Hindi
Checkout the series: 🔥🔥🔥
👉 Recursion : • Recursion
👉 Stack and Queue : • Stack And Queue
👉 Greedy : • Greedy
👉 Leetcode contests : • Leetcode contests
👉 Leetcode June Challenge : • Leetcode June Challenge
LIKE | SHARE | SUBSCRIBE 🔥🔥😊

[@yugalvashishth8544]

Your voice is so pleasing to ears

[@AyushiSharmaDSA]

Thank you 😊

[@19abhishekgupt70]

Thank you very much ma'am i wish I could show you my number of attempts 😅but one more thing i only took a basic idea about this problem although the category of this question is hard according to leetcode but after watching your explanation till 4 to 5 min i got the idea and solved it easily 😅 thanks 🎉

[@AyushiSharmaDSA]

Thank you Abhishek, means a lot 😊✌🏻

[@amanpreetsinghsetia1524]

Nice Explanation!

[@AyushiSharmaDSA]

Thank you Amanpreet :)

[@aniketbhura6131]

like going for least rating .. give them 1 candy then go to rating that is more than previous and give them max (left and right) +1 . and so on?

[@santoshpathak8201]

explained at its best ... love it

[@AyushiSharmaDSA]

Thank you Santosh 😊

[@aniketbhura6131]

this can also be done in a single traversal ?

[@desihiphop4998]

Thanks di bilkul clear hogya !!!

[@AyushiSharmaDSA]

Welcome! glad it was helpful :)

[@ishangujarathi10]

greatt explanation of leetcode hard question!!

[@AyushiSharmaDSA]

thank you, glad it was helpful :)

[@aniruddhkarekar2818]

thanks didi

[@AyushiSharmaDSA]

Welcome Anirudh :)

[@tusharjeena7081]

Mam you are so great ,the way you are teaching is far better than the college professor
can you please tell me from which college you are

[@AyushiSharmaDSA]

Thank you Tushar :)
I’m from Guru Nanak Dev Engineering college

[@filmreviewer2089]

Mam please make a video on Which Subjects we should bstudy for placement.
I am in 2nd year in btech IT.

[@AyushiSharmaDSA]

Yes, I will make it soon 🙂

[@divashgupta5871]

Whats the need of candy condition?

[@puneetbhandari1134]

why their is a candy condition .....why you comparing candy ??

[@MadhavGupta-fi2tu]

kya pyaari awaz h

[@rishavagarwal6531]

I have a doubt!.. You are doing 2 traversal.. First from left to right and then from right to left... Can we do in a single traversal? (That is only from left right and comparing neighbors)

[@AyushiSharmaDSA]

no, it won't work using single traversal as the value depends on neighbors and those value can change after. Try to do it with test case, it will be more clear.

[@sahilverma4142]

First of all it doesn't work. But why are u thinking for single traversal. The tc will remains same in both cases.

[@rishavagarwal6531]

We all think that single or two traversal time complexity remains same but in reality two traversals takes more time and it's so small that we doesn't count it in theory!.. It has some delay!.. Secondly I currently was interviewed in Amazon... They were asking everything in single traversal though 2 traversals also take same time

[@rishavagarwal6531]

And they only told me the reason!.. Never think 2 traversals and single traversal takes same time!.. In theory its okay but in practical life it's not

[@AyushiSharmaDSA]

@@rishavagarwal6531 did they ask you the same question?

[@ekanshsharma1309]

didi ye approach click kese kari 🥲???

[@rishavagarwal6531]

Are u a student or doing job?

[@AyushiSharmaDSA]

I am in final year doing internship

[@rishavagarwal6531]

Which company if it's comfortable to ask?

[@AyushiSharmaDSA]

@@rishavagarwal6531 you can connect with me on LinkedIn : www.linkedin.com/in/ayushi-sharma-8a285a185/