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 UA-cam 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
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.
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 UA-cam 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.
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)
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.
Great explanation man! All my worries are gone!! Please make videos regularly
reminds me of my graduate algorithms class. can't imagine coding this in an interview though lol!!
Hes Back!!!!!!
You do an amazing job man, Thank you soo much
Thank you!