Even though this is a "medium" in leetcode, this guy makes every coding problem seem like an easy one. Hey man, you've got such great teaching skills. Thank you for sharing your algo approaches here. This channel is definitely gold.
@mocamoca_enh2 жыл бұрын
I have a couple of coding interviews coming later this month. Not expecting much since I pretty much just started relearning a few weeks back but emulating and learning from your explanations and solutions helped me learn more in those couple of weeks than I have in months of bruteforcing LC back in college.
@pseudo_adult17 Жыл бұрын
Ty! np: sorted() converts the set of nums array to the list in Python; can skip list() function of line #4
@krishnachaitanyapullakandam2 жыл бұрын
This is by far one of the best DP explanations, thanks so much!
@chahalpawanpreet Жыл бұрын
This is an exceptionally well taught lesson
@NeetCode Жыл бұрын
Thank you!
@vedantshinde22772 жыл бұрын
I implemented a sub-optimal solution using hashmap and set which worked for 50% of the testcases but when you said it is similar to house robber, a light-bulb went off in my head!! You're a real G!
@roadtomillion94992 жыл бұрын
Hey I'm new to leetcode I recently found your channel I do solve easy problems by following your explanation But it seems I tend to forget the problem that I solved within a week How to retain the concepts that you teach in every video?
@mrditkovich23392 жыл бұрын
Hi, I was facing the same problem beforehand. Any coding problem has 2 things: intuition and coding. You only have to remember the intuition. Once you are able to understand it, coding is no big deal !
@roadtomillion94992 жыл бұрын
@@mrditkovich2339 hey thanks for the suggestion These days I started to write down those algorithms in my notebook then execute them in code Now I'm feeling far better
@mrditkovich23392 жыл бұрын
@@roadtomillion9499 Glad to hear ! As an addition, please prefer quality over quantity. Most of the questions related to graph and DP follow a pattern.
@omarhosny69472 жыл бұрын
@@roadtomillion9499 I also recommend following with the Spaced Repetition System in order to revisit what you have solved.
@firezdog9 ай бұрын
another small improvement would be to consider i = 0 as a base case, i.e. fill out earn1 as 0 and earn2 as nums[0] * counts[nums[0]], then start iterating from i = 1
@freshlyminted69992 жыл бұрын
sooo elegant - thank you!!
@sdmfslkdm Жыл бұрын
did the recursive solution on my own but optimising this is tough
@yang58432 жыл бұрын
I'm surprised you're not sharing the time optimal solution, the O(n) version instead of the O(nlogn) one
@AshutoshKumar-es8xy2 жыл бұрын
How nlogn
@ashishchoubey13802 жыл бұрын
@@AshutoshKumar-es8xy sorting was used
@orellavie62332 жыл бұрын
Instead of commenting meaningless information, publish it
@Aripoma10 ай бұрын
A year passed and you haven’t provided the o(n) solution
@deepakumari18582 жыл бұрын
Hey, Can you please also mention the Time and Space complexity of the final solution in your videos....Interviewers generally ask for it. Thanks.
@hemesh56632 жыл бұрын
Hey, the time complexcity is nlogn because we are sorting and traversing through the array once and space is complexity is 2n one of dictionary and other for array but if we take big oh then it is n. Hope it helps.
@ananya___16252 жыл бұрын
wow..You gave a very good hint which made me solve the problem without watching the solution .. Anyways watched the solution after solving..Thank you very much for your efforts
@yang58432 жыл бұрын
Was this question inspired by someone on your discord?
@NeetCode2 жыл бұрын
Yeah, I wanted to do it much sooner... but better late than never :)
@robalexnat2 жыл бұрын
Mr NeetCode, how can we ever achieve your level of intuitive understanding of algorithms, dynamic programming, and the like? Where should we look?
@mdlwlmdd2dwd302 жыл бұрын
Just practice
@chasevanhaselen16802 жыл бұрын
why do we only need to look at the two previous values? couldn't values before then change depending on which current value we choose?
@shashijais7892 жыл бұрын
Brilliant explanation. Thanks for this.
@NeetCode2 жыл бұрын
No problem 👍
@gary19512 жыл бұрын
If we have [2,3,5] and we choose 5, won't we get 5 + 3 + 2 =10? from your method and leetcode would say is only 8.
@vishwaashegde49872 жыл бұрын
you cannot add 2,3 since 3-1=2
@raghav5354 Жыл бұрын
If I get into faang, you deserve my first salary lol. such a quality explanation
@johnbanyan11 Жыл бұрын
I'll atleast meet him and give me a hug.
@rajeevradnair2 жыл бұрын
Dear Neetcode - why did you sort your array? And why did the DP function not include numbers greater than the selected value (like n+2, n+3, etc)
@sauravgupta7415 Жыл бұрын
So that we can track the n-1 numbers easily. Also at every index we maintain the max value.
@chinmayp58593 ай бұрын
Amazing Explaination !
@yashgupta-fk3zc2 жыл бұрын
in 5 min of a video i was able to code it my self
@vikassinghbhadoria43862 жыл бұрын
i really like ur explaining method but the thing is i and most beginner cp enthusiast code in c++ this creates a prblm for all of us if u can code in c++ that will be really helpfull for us thanks btw
@_rohit972 жыл бұрын
@ time stamp 12:48 you told you over complicated it up! Bruhh Nooo you did not! It was pristine!
@ngneerin2 жыл бұрын
Thanks. More videos will be appreciated 🙂
@11iqra10 ай бұрын
Amazing explanation!
@mananhingorani25513 ай бұрын
Leetcode weekly 402, almost similar question came (Q3)
@firezdog9 ай бұрын
it seems unnecessary to make nums into a set -- if you are going to use a Counter() you get a set out of the keys anyway
@yagniktalaviya21462 жыл бұрын
man, you are everywhere!!
@dineshpabbi70052 жыл бұрын
Guys I find it very discouraging when I cannot figure out a DP problem. I want to be able to make base cases but some of the questions just have this weird trick.. Is it just me ?
@ahmedzaidi4228 Жыл бұрын
only if this dude coded in c++
@bryannaoumbarakat4144 Жыл бұрын
HI, i don't know if you are answering but i am not getting the idea of the start of the operations, like when we have earn1 = 0 and earn2 = 0, i am trying to imagine it as a dp list and apply it but lost
@amanshujaiswal4728 Жыл бұрын
good explanation
@TVSh0rts Жыл бұрын
The fact You have to know that You need to sort it first and then eliminate duplicates is ludicrous. How on this earth is anyone supposed to come up with that? it's just guessing
@ronakshah725Ай бұрын
You don’t
@anjaliyadav93602 жыл бұрын
Thanks !
@AbhishekS-cv3cr Жыл бұрын
damm that was such a good explanation
@aayushpagare9366 Жыл бұрын
Once he draws a recursion tree i can write a recursive code
@shrimpo64162 жыл бұрын
LLLLLLLOVE this explanation!!!!!!
@ahmedhamed51332 жыл бұрын
Amazing
@soumikkarmakar74332 жыл бұрын
for(int i=2;i
@soumikkarmakar74332 жыл бұрын
man!!! i wasted like 3-4 hours and the mistake was i didn't put == inside the if statement and it didn't even show an error.
@bidishadas8323 ай бұрын
Can you please share your complete code? I am getting 47 where it should be 37
@soumikkarmakar74333 ай бұрын
@@bidishadas832 Here you go. It isn't concise tho because I was a noob back then. class Solution{ public: int deleteAndEarn(vector& nums){ if(nums.size()==1) return nums[0]; if(nums.size()==2){ sort(nums.begin(),nums.end()); if(nums[0]+2>=nums[1]) return (nums[0]+nums[1]); else if(nums[0]==nums[1]) return 2*nums[0]; else if(nums[0]+1==nums[1]) return nums[1]; } map m; for(int i=0;i