FIND DUPLICATE SUBTREES | LEETCODE # 652 | PYTHON DFS SOLUTION

[@dnm9931]

Excellent video again! Please do videos on all neetcode 150, your concise , clear explanations are appreciated and needed ! Thank you so much!

[@crackfaang]

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

[@dnm9931]

@@crackfaang or complete the blind 75? Your efforts are appreciated btw , no hard feelings

[@crackfaang]

​@@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

[@dnm9931]

@@crackfaang then how would you recommend is the best way to prepare for a faang interview? Or is a majority of it luck?

[@crackfaang]

​@@dnm9931Video coming out on this soon. But yes lots of memorization + luck on the day that you get a question you've seen before

[@mohsenvazirizade6334]

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.

[@subee128]

Thanks

[@zungulutrungu6407]

you're close to 1000 man, keep it up!!

[@paradox2738]

I dont understand the need to pass path as a parameter, it works without it

[@zungulutrungu6407]

the thumbnail game is getting even better!!

[@crackfaang]

Improving every day

[@ramymousa4189]

Thank you. keep posting!

[@crackfaang]

Will do! Keep watching!

[@hanjiang9888]

thank you!!! well explanation

[@MeetManga]

Is the time complexity ON， Are you sure？

[@MeetManga]

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

[@MeetManga]

And, the space complexity is also N²

[@bigbussington4755]

@@MeetManga Ur wrong

[@jyothi9082]

time is indeed O(N2)

[@dnm9931]

Chatgpt says he’s correct lol

[@danearcher8338]

why is the comma needed in the join? it doesn't pass a test case with out it

[@progdevel]

coz there may be several numbers going one by one

[@akakartik]

The audio in your videos is very low ,I think increasing it,it will be more helpful

[@crackfaang]

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

[@akakartik]

@@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 😄😄