Candy - Leetcode 135 - Python

[@LeeK301]

One way I try to challenge myself when solving these problems: If I can't solve intitally and I am just stuck, come to NeetCode's videos and watch the intuition portion. If I feel like I have a good idea of what he's talking about, I will pause the video and attempt to solve again under a time limit. If I can't solve it again, I will come back to his vid and watch for the solution as well.

[@RhoBustDev]

appreciate it, its the same for me :)

[@victortruong2538]

Oh I was waiting for you :) yes the problem is poorly worded I feel

[@0brooo]

THIS is a valid solution to this problem. I was looking at the solutions with the most upvotes, and their solution was to mathematically solve it by adding up all the longest increasing subarray and decreasing subarray, and then subtracting the lowest of the two from the totalCandy. I hate that leetcode solutions have become mathematically solutions rather than programming. Solutions for the CarFleet problem is a hashmap with the key being the product of a formula. Then returning all the unique keys. Like what is that, the solution should go through a process that imitates the problem. Now we’re seeing problems that are purely solved by inventing a formula for the specific issue. Rather than preparing you for problems you’ll face regularly

[@HtotheG]

I came up with the O(n^2) solution with a while loop of while(candyIncreasedThisLoop){ do a pass and add 1 if the rules arent followed for each } and I was proud of myself, but damn this code is not only neat is damn near beautiful 😢 Thank you for the great explanation as always you are a huge help in my career journey as a new grad at the moment. I can't thank you enough for your years of backlogs of coding solutions I am learning from right now. Keep up the amazing work!

[@harshiv2005]

Same dude

[@cody-wq7zc]

same

[@adamlin2301]

And this is how your boss think of giving salary to you

[@HR-pz7ts]

Thanks man you're so good that I never had to wait for you to code.

[@VarunMittal-viralmutant]

An alternate to the last step: if ratings[i] > ratings[i+1]: arr[i] = max(arr[i], arr[i+1]+1) That was more intuitive for me: if ratings[i] > ratings[i+1] and arr[i]

[@JasonAhn-u5u]

I only thought about iterating through left -> right..always amazing

[@studimeyt5219]

same 🤧

[@GuruPrasadShukla]

very well explained! just like interview style!

[@CognitiveAnkit]

You are totally more than awesome You explained this concept in such an awesome manner I have no words for it

[@dineshkumarkb1372]

Thanks for uploading this. I had requested for this in the comments in one of your videos.

[@hannibalm090009]

Thanks a lot bro, I actually just solved it had to pause the video at the mid of the intuition because that was the missing part that I needed, went and solved it then got back.

[@abdelrahmanashraf1510]

You mentioned that no extra memory is needed, yet your solution clearly allocated a new array to track the number of candies given. Doesn't that make the space complexity O(n)?

[@NeetCodeIO]

Yep, that's my bad. Space is O(n)

[@abdelrahmanashraf1510]

@@NeetCodeIO Thanks for clarifying! appreciate your efforts and explanations 👍🏼

[@socialbeing5591]

literally the best explaination

[@iCodeStuff69]

Quite much easier problem than lots of "easy" ones.

[@schrodingerskatt222]

Amazing explanation !!!!. Greedy Questions are just mind blowing.

[@AyushSharma-ux4fk]

Yea, greedy hits you up as if you never know what has happened.

[@joey_zhu]

I derived my solution by going deep into the diffs array and trying to reduce it to other problems, my soln ended up going to 30+ lines so i was quite disappointed to go into the solutions and see that ppl had done it in like 10 lines

[@CodeWithRVR]

Wait is over guys 😅

[@CodeSuccessChronicle]

Best Explanation 👏🏻 Nice work great intution

[@jaishriharivishnu]

how you get so good at logic, damn nice and nice , best approach

[@stith_pragya]

Thank You So Much for this wonderful video...🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻🙏🏻

[@deepakjain248]

isn't it O(n) space solution as we are using extra array to store candies ?

[@omdandade8245]

I missed that "welocme back" this morning...

[@VidyaBhandary]

Genius explanation... Wow

[@krateskim4169]

was waiting for this

[@elizabethr5161]

Best explanation ever

[@aisteelmemesforaliving]

Seems like this problem can be solved in one pass too, but I have a hard time understanding that lol. Would've been nice if you could explain the onepass method because I can understand your explanations only. Others take way too much time drawing, or do a poor job of explaining.

[@aisteelmemesforaliving]

​@@Stay_away_from_my_swamp_waterno, apparently, you can use three variables up, down and peak and then do something which I don't understand to complete this in one pass and O(1) space complexity. It's the top solution on solutions page (by vanAmsen). I don't think I can post links here, the spam filter will probably go off.

[@stefanopalmieri9201]

@@aisteelmemesforaliving I'm also looking for a better explanation of that algorithm. If I figure it out, I'll make a video.

[@aisteelmemesforaliving]

@@stefanopalmieri9201 please don't forget to reply to this if you actually do. Highly appreciated.

[@stefanopalmieri9201]

@@aisteelmemesforaliving It's uploaded now: kzbin.info/www/bejne/lZ2cf5KCmNWfgtU

[@himanshu6489]

any luck?@@aisteelmemesforaliving

[@FUNTasticFlutter]

good job man. very helpful series......

[@aditya-lr2in]

Was waiting for this :)

[@ishaqniloy1532]

Finally solved the problem. Thank you so much!

[@RishabhSingh-xn3xu]

solve on your own,give your everything to solve the problem

[@pixelup4929]

@@RishabhSingh-xn3xu 🤣

[@Meridian-lk2fo]

First LC hard I solved on my own! :)

[@simranvedpathak7112]

Cool buddy

[@truongtran99_]

You're a genius

[@aadityakiran_s]

11:52 precisely. Did you make that same mistake there?

[@mahinhossen4251]

I have seen a 0(1) space solution in lc solution section. Could u explain it in a future vid

[@becomingbesthackerprogramm4644]

How to get referrals brother, I worked really hard , solved 500+ problems on leetcode but still I m suffering to get interviews

[@becomingbesthackerprogramm4644]

Please help me I m sm out of hope right now

[@Jambajakumba]

I feel you man, me too.

[@apoorvasingh5702]

Well explained 👍

[@Manishgupta200]

Great explaination ❤

[@uptwist2260]

Thanks for the daily

[@chinni469]

This was asked to me in an interview and of course, I messed it up😭

[@Antinormanisto]

How i can get big brain like your?

[@satwiktatikonda764]

this one looks easy after seeing solution ,but how to endup with this intuition !!!

[@suniln9029]

Can you explain one pass approach?

[@ahamedsha9688]

the problem is not enough described in leetcode 12:08 stuck 2 days because i did not take that into account

[@stefanopalmieri9201]

This is an O(N) space solution but a O(1) space solution does exist for this problem.

[@hwang1607]

Now do it using O(1) space

[@hwval-zw4hy]

It's O(n) additional memory, isn't it?

[@mohithadiyal6083]

The best

[@CS_n00b]

I have no idea how I could figure this out on my own tbh

[@PriyaSharma-z5e3o]

Corporate in a nutshell

[@langacristian8366]

im too dumb for this shit chief

[@pryshrng]

not pertaining to the question or this video, but what's the difference between this channel and the original channel? @neetcode