Thank you for the solution. I think this approach is O(N**2) due to line 11. Also, there is no point in having path as an input argument to the function.
Why would I make videos for someone else's list. I already put out a spreadsheet with problems for people to learn LC that relies more on chains of similar problems such that you can solve questions that are similar in nature: learning patterns and being able to apply previous knowledge to new questions
@@dnm9931All good, I know you didn't mean anything malicious by it. I personally don't see the point of those lists because they give you a false sense of hope that solving X questions == ready to ace Google interview. That simply isn't the case and if anything they are only useful for just getting a basic breadth first knowledge base
I do believe the time complexity of your solution is ON²， cuz， there are N² subtree， every subtree need to be compare by the hashmap. correct me , if I'm wrong. thank you
Hmm you aren’t the first person to mention this. I speak directly into the mic so not sure what’s up. Maybe I can tweak my audio settings when rendering the video. Thanks for the heads up
@@crackfaang I think maybe a better microphone is needed, your content is really good and the only thing I think that is holding to blow this channel up is the sound issue, hope you will fix it soon 😄😄
![[Java] Leetcode 652. Find Duplicate Subtrees [Binary Tree #10]](/img/n.gif)
Thank you for the solution. I think this approach is O(N**2) due to line 11. Also, there is no point in having path as an input argument to the function.
Excellent video again! Please do videos on all neetcode 150, your concise , clear explanations are appreciated and needed ! Thank you so much!
Why would I make videos for someone else's list. I already put out a spreadsheet with problems for people to learn LC that relies more on chains of similar problems such that you can solve questions that are similar in nature: learning patterns and being able to apply previous knowledge to new questions
@@crackfaang or complete the blind 75? Your efforts are appreciated btw , no hard feelings
@@dnm9931All good, I know you didn't mean anything malicious by it. I personally don't see the point of those lists because they give you a false sense of hope that solving X questions == ready to ace Google interview.
That simply isn't the case and if anything they are only useful for just getting a basic breadth first knowledge base
@@crackfaang then how would you recommend is the best way to prepare for a faang interview? Or is a majority of it luck?
@@dnm9931Video coming out on this soon. But yes lots of memorization + luck on the day that you get a question you've seen before
I dont understand the need to pass path as a parameter, it works without it
you're close to 1000 man, keep it up!!
the thumbnail game is getting even better!!
Improving every day
why is the comma needed in the join? it doesn't pass a test case with out it
coz there may be several numbers going one by one
Thanks
Thank you. keep posting!
Will do! Keep watching!
Is the time complexity ON， Are you sure？
I do believe the time complexity of your solution is ON²， cuz， there are N² subtree， every subtree need to be compare by the hashmap. correct me , if I'm wrong. thank you
And, the space complexity is also N²
@@MeetManga Ur wrong
time is indeed O(N2)
Chatgpt says he’s correct lol
thank you!!! well explanation
The audio in your videos is very low ,I think increasing it,it will be more helpful
Hmm you aren’t the first person to mention this. I speak directly into the mic so not sure what’s up. Maybe I can tweak my audio settings when rendering the video. Thanks for the heads up
@@crackfaang I think maybe a better microphone is needed, your content is really good and the only thing I think that is holding to blow this channel up is the sound issue, hope you will fix it soon 😄😄