If anyone wants to try , it is LC 515. Not exactly the same, instead of product you have to print a list of max values. But you can try your variation in it. Thanks for this run through!
This is an incredible video! I've been so anxious about preparing for coding interviews, but you made the process feel so approachable and manageable. I'm really glad this showed up in my recommendations and will definitely be working through the rest of your videos as I continue to prepare for interviews! Thank you and keep up the amazing work :)
This is amazing content! This is literally the secret sauce (after leetcoding) for any technical interview. Thank you so much for your time and effort in helping all of us obtain our dreams.
I'm glad I found your channel, it has been very helpful for me, especially this video, when I solved questions on leetcode I always skipped step 2 and 5, time to include them in my preparation I guess. I appreciate the videos and am inspired by your consistency of making them.
Yes yes it’s in my queue. This week was quite crazy and I only got around to Word Ladder I. Luckily they are basically the same question with some minor details
BTW shout out to you for making this amazing video's I really find it amazing. Hope you continue to make more of such kind. What would be even more interesting is creating a small discord channel for this community where one can discuss about future video's/ questions in details.
I will look into this. Though I already have so much on my plate that it’s going to be tricky to then manage a discord server and respond to questions/make sure people aren’t chatting random shit in the server and ruining the experience for others lol
It is an amazing video. Love every concept of it. I am still anticipating the system design videos as well. Well done and thank you so much for the free premium content 😊. Emphasis on free please..😀 😊
Haha of course. Content will always be free here. Hopefully in the future I can have a channel sponsor so I can make some money from ads and keep everything free and accessible for everyone
Interesting verification approach of annotating state in a separate comment block, instead of inline with the code. Have you tried both and found this works better?
Doesn’t matter, you return the final product. Can be positive, negative, or even zero if you encounter one. Doesn’t matter for this problem but may for others
Java version: private static int findMaxProduct(TreeNode root) { final Queue queue = new LinkedList(); if(root == null) return -1; queue.add(root); int result = 1; while (!queue.isEmpty()) { int qSize = queue.size(); int max = Integer.MIN_VALUE; while (qSize-- > 0) { //loop only item at current Level "L" final TreeNode current = queue.poll(); max = Math.max(max, current.value); if(current.left != null) queue.add(current.left); //add L+1 level item if(current.right != null) queue.add(current.right); //add L+1 level item } result *= max; } return result; }
If anyone wants to try , it is LC 515. Not exactly the same, instead of product you have to print a list of max values. But you can try your variation in it.
Thanks for this run through!
Awesome content , preparation and great insight on the tips for interviewing as well! Your work is much appreciated and looking forward to more
This is an incredible video! I've been so anxious about preparing for coding interviews, but you made the process feel so approachable and manageable. I'm really glad this showed up in my recommendations and will definitely be working through the rest of your videos as I continue to prepare for interviews! Thank you and keep up the amazing work :)
Thanks for the kind words! Glad the videos are helping
This is amazing content! This is literally the secret sauce (after leetcoding) for any technical interview. Thank you so much for your time and effort in helping all of us obtain our dreams.
I'm glad I found your channel, it has been very helpful for me, especially this video, when I solved questions on leetcode I always skipped step 2 and 5, time to include them in my preparation I guess. I appreciate the videos and am inspired by your consistency of making them.
Great video! Very concise and to the point! Specificity kills ambiguity.
Highly informative and helpful! Thanks for this.
Requesting Word Ladder 2 in the upcoming videos.
Yes yes it’s in my queue. This week was quite crazy and I only got around to Word Ladder I. Luckily they are basically the same question with some minor details
BTW shout out to you for making this amazing video's I really find it amazing. Hope you continue to make more of such kind. What would be even more interesting is creating a small discord channel for this community where one can discuss about future video's/ questions in details.
I will look into this. Though I already have so much on my plate that it’s going to be tricky to then manage a discord server and respond to questions/make sure people aren’t chatting random shit in the server and ruining the experience for others lol
@@crackfaang You can actually put some restriction's on discord, If you want any help I can manage it for you.
Nice videos
amazing video.
It is an amazing video.
Love every concept of it.
I am still anticipating the system design videos as well.
Well done and thank you so much for the free premium content 😊. Emphasis on free please..😀 😊
Haha of course. Content will always be free here. Hopefully in the future I can have a channel sponsor so I can make some money from ads and keep everything free and accessible for everyone
I'm already here before this channel will reach million subs!
Hell yea brother, one day at a time we get closer to the goal 💪
This was super helpful!
Interesting verification approach of annotating state in a separate comment block, instead of inline with the code. Have you tried both and found this works better?
Besides the awesome sauce that youve given us, I just wanna point out that you kinda sound like Joji
Another question might be if the values all are positive and non zero numbers
You are the best!
Thanks mate!
Sir, thank you a lot.
I dont have trouble with algorithms. I have trouble with the OOP design questions
Systems design series coming very soon. Stay tuned
+1
thanks
Is faang similar to the step internship in google
Goated
what if the tree contains negative values?
Doesn’t matter, you return the final product. Can be positive, negative, or even zero if you encounter one. Doesn’t matter for this problem but may for others
@@crackfaang Yes you are correct, I shud have read the question more carefuly, guess I failed at step 1 😅
Java version:
private static int findMaxProduct(TreeNode root) {
final Queue queue = new LinkedList();
if(root == null) return -1;
queue.add(root);
int result = 1;
while (!queue.isEmpty()) {
int qSize = queue.size();
int max = Integer.MIN_VALUE;
while (qSize-- > 0) { //loop only item at current Level "L"
final TreeNode current = queue.poll();
max = Math.max(max, current.value);
if(current.left != null) queue.add(current.left); //add L+1 level item
if(current.right != null) queue.add(current.right); //add L+1 level item
}
result *= max;
}
return result;
}
Am I the first one to see this video😅?