ALIEN DICTIONARY | LEETCODE 269 | PYTHON TOPOLOGICAL SORT DFS SOLUTION
Vložit
- čas přidán 26. 07. 2024
- Channel Discord Community: / discord
Problem Link: leetcode.com/problems/alien-d...
Today I once again dust off my microphone and bring you a solution video for one of my favorite problems of all time: Alien Dictionary.
This is a fun problem that uses topological sort to solve but building the input graph is quite tricky given the constraints of the problem.
TIMESTAMPS:
00:00 Intro
00:18 Question Prompt
00:59 Basic Examples
02:10 In-Depth Example + Intuition
09:15 Coding
20:40 Time/Space Complexity
23:00 Outro - Věda a technologie
I can't put a finger on why your solutions have been preferable over Neetcode for me but they have been! I was intimidated by this question but it's now much less intimidating and more fun! Thanks again bro
Glad you're enjoying the content and I hope others start preferring my channel to Neetcode's. Though I'm not sure the CZcams algorithm would push mine in the same way because I'm much much smaller of a channel
Neetcode started small too man. I've cracked IG's "algorithm" before and you just gotta be consistent. Meta's hiring is ramping up and you're definitely gonna get more viewers.
I'd recommend not having your videos private yet tho bro. I had to log into view this. If someone didn't know how great your solutions are, and saw other videos that are readily available, then they'd just watch that.
But that's just unsolicited advice. Thnx again for the hard work! @@crackfaang
Oh damn, I have to pay to watch the solutions now? TBH, I think that's a bad move homie.@@crackfaang
Always a big fan of your videos
Thanks for being a loyal viewer. Hopefully the vids are helping with your interview prep
They’re definitely helping me.
I had no idea how to solve this one. Your solutions are great and easily understandable than Neetcode for me personally. The solution code is not tricky and I am not trying to enter a competitive programming mindset so understanding code is what does it for me and your videos provide it. Keep shipping out more solutions and I feel you will have 100k soon.
Thanks for the kind words and glad you found the video helpful. This is one of my favourite questions so glad I did a good job explaining it.
And less hopefully 100k one day but the growth is slow. I think Neetcode just dominates the market due to being recommended first. Oh well, one step at a time. I know I could get a lot more subscribers if I did videos with a camera and talked about real world experiences instead of LC questions but not ready to do that as I'd probably be told by HR to either quit or stop making the videos lol
@@crackfaang I feel like its more because of availability of solutions. I code in python and now I look for videos from you but there are a lot more videos done by Neetcode ofcourse. Like I said, keep shipping out more videos and you have the explanation to hit that growth once you have enough videos on LC solutions.
You do an amazing job man, Thank you soo much
Great explanation man! All my worries are gone!! Please make videos regularly
Thank you!
Can you do a video on sliding windows and how to tackle those questions? The main issue that I am having is getting the time complexity to o(n)
reminds me of my graduate algorithms class. can't imagine coding this in an interview though lol!!
Hes Back!!!!!!
In your video of Course Schedule and Course Schedule ||, you have white.pop() instead of next(iter(white)) in the main function and white.discard(node) in DFS. Can you explain why is it different here? I tested white.pop() and I know that it does not work but not sure why!
Are you sure? I tried white.pop() in my alien dictionary solution and it was accepted.
I think pop() is probably preferred. Don't know why I was using next(iter(white)), must have gotten confused or thought the problem was slightly different.