🚀 neetcode.io/ - 25% OFF LAUNCH SALE Just released the first batch of Advanced Algorithm lessons, along with some other updates. A lot more updates coming soon! 🙂
Wow, you work really hard lately. That's really a great contribution to the society. I started watching your solution last year when there were just a few videos in this channel. Now you really make it to a whole new level. Sadly, I just solved around 150 problems for a whole year.
with this pace you'll need 15 yrs to touch all curr existing problems on lc, not to mention new problems posting bi-weekly... isn't it sound scary :P make me think about life lol
@@chaoluncai4300 yea, that's too scary, not to mention that I am graduating in less than 6 months. hahaha. I seriously need somebody to shout at me everyday to speed up. Otherwise, my job seeking is gonna be a nightmare.
How important are the iterative (stack) versions of these recursive solutions from an interview point of view. Because for most problems, if the recursive approach is easy then figuring out the iterative one is almost medium to hard.
Your videos are the most intutive ones.......... Surviving cp bcoz of you brother, If one day I get into Amazon, I will give u whatever u ask for ❤❤❤❤❤❤❤❤
Hi Sir, I am waiting for your solution to problem #99, 'Recover Binary Search Tree', and an explanation of Morris Traversal if that is the appropriate approach to solve it.
I recently gave Amazon SWE intern interview, I was asked to find bottom -right view of a tree, at first it may appear hard, but it was just diagonal order traversal and getting last element from each diagonal.
I have a question, I have participated in a couple of Open Source Programs but couldn't do an Internship. So are my chances slim inorder to get my resume shortlisted as I have only mentioned those Open Source Programs contributions in my resume work experience section?
@@varunshrivastava2706 i have applied through on-campus placement cell. Resume shortlisting is namesake, infact I have no prior internship experience, i have just participated in many hackathons and I have projects.
@@varunshrivastava2706 open source will (just) will not work you WILL need to participate in some coding contests. I am having interviews in October, I recently graduated from a tier 3 college and believe me I tried everything in my college days but nothing will work if you don’t have data structure and algorithmic skills
@@Dr-Doggo Yup agree with you I am not completely relying over open source. I have been doing Open source + Dev + DSA for the past 1 year. The reason why I specifically mentioned open source was because I didn't have anything else to put in my work experience section. And some people suggested me to put my open source program experience in it.
Good explanation but imo it's not just the problem description that's bad but the problem details themselves. I see no reason why the first example isn't ambiguous. Why should leaving out the empty paranetheses be ok on the right but not on the left? Just bc reading left-to-right is natural? Makes no sense to me. imo the expected output is ambiguous and can stand for both of the given example trees. At least a very imprecise explanation which is obviously a no-go for stuff like this.
🚀 neetcode.io/ - 25% OFF LAUNCH SALE
Just released the first batch of Advanced Algorithm lessons, along with some other updates. A lot more updates coming soon! 🙂
I love the videos you made .Thanks
lets goo more leetcode
Thanks for making such amazing and very helpful videos!!
Woah, you rich man lol. Congrats on the job offer🎉🎉
Wow, you work really hard lately. That's really a great contribution to the society.
I started watching your solution last year when there were just a few videos in this channel. Now you really make it to a whole new level. Sadly, I just solved around 150 problems for a whole year.
with this pace you'll need 15 yrs to touch all curr existing problems on lc, not to mention new problems posting bi-weekly... isn't it sound scary :P make me think about life lol
@@chaoluncai4300 yea, that's too scary, not to mention that I am graduating in less than 6 months. hahaha. I seriously need somebody to shout at me everyday to speed up. Otherwise, my job seeking is gonna be a nightmare.
@@chaoluncai4300 150 questions is more than enough to get grasp of concepts of algo. Make sure you can do questions on your own.
i forgot how much i enjoy these videos.
I've got the Amazon New Grad final tomorrow and I was just about to get to this question from the Amazon tagged list. Neetcode coming in clutch again!
@Isaac Mattern Same here. not recieved the link.
I applied for intern at dublin and havent heard back
How'd it go man?
Bro!! did you get the amazon new grad job????
@@tu4012 passed the interview but hiring freeze hit
how did it go ?
Thanks!
Please don't stop uploading solutions! You are really awesome!
How important are the iterative (stack) versions of these recursive solutions from an interview point of view. Because for most problems, if the recursive approach is easy then figuring out the iterative one is almost medium to hard.
Your videos are the most intutive ones.......... Surviving cp bcoz of you brother, If one day I get into Amazon, I will give u whatever u ask for ❤❤❤❤❤❤❤❤
Feeling grateful to listen to your explanations neet
Please make similary solution daily for the Leetcode Daily Challenges.. Otherwise i have search all over the youtube for other days..
THanks.
Thanks for your videos and efforts🙏
Hey could you upload a video for Gray Code question. ik there are multiple solutions in the net, but i feel like ur explanations reach me better
Hi Sir, I am waiting for your solution to problem #99, 'Recover Binary Search Tree', and an explanation of Morris Traversal if that is the appropriate approach to solve it.
How would a binary tree with no left node be represented in array (the input in this case)?
Thanks for the awesome content
Which app do you use to draw?
I recently gave Amazon SWE intern interview, I was asked to find bottom -right view of a tree, at first it may appear hard, but it was just diagonal order traversal and getting last element from each diagonal.
I have a question, I have participated in a couple of Open Source Programs but couldn't do an Internship. So are my chances slim inorder to get my resume shortlisted as I have only mentioned those Open Source Programs contributions in my resume work experience section?
@@varunshrivastava2706 i have applied through on-campus placement cell. Resume shortlisting is namesake, infact I have no prior internship experience, i have just participated in many hackathons and I have projects.
@@varunshrivastava2706 open source will (just) will not work you WILL need to participate in some coding contests. I am having interviews in October, I recently graduated from a tier 3 college and believe me I tried everything in my college days but nothing will work if you don’t have data structure and algorithmic skills
@@Dr-Doggo Yup agree with you I am not completely relying over open source. I have been doing Open source + Dev + DSA for the past 1 year. The reason why I specifically mentioned open source was because I didn't have anything else to put in my work experience section. And some people suggested me to put my open source program experience in it.
@@ankitsharma1072 How many rounds of interview do you have to go through. As I have taken referral for sde 1 role at Amazon.
Wow, this was just excellent
I have no idea what you just did, but thank you.
Hey, what software do you use to draw explanations on your video?
paint
Thank you
Thanks a lot
Wow, Welcome back.
Super Thanks
Good explanation but imo it's not just the problem description that's bad but the problem details themselves. I see no reason why the first example isn't ambiguous. Why should leaving out the empty paranetheses be ok on the right but not on the left? Just bc reading left-to-right is natural? Makes no sense to me. imo the expected output is ambiguous and can stand for both of the given example trees. At least a very imprecise explanation which is obviously a no-go for stuff like this.
string dfs(TreeNode* root){
if(root == NULL) return "";
if(root->left == NULL and root->right == NULL) return to_string(root->val);
string temp = to_string(root->val);
string l = "(" + dfs(root->left) + ")";
string r = "";
if(root->right){
r = "(" + dfs(root->right) + ")";
}
return temp + l + r;
}
string tree2str(TreeNode* root) {
return dfs(root);
}
update ur roadmap
How is this considered an easy problem? ahah
Thanks!