Interview Question: Build Order

[@shachari3339]

This is really good. Thank you!

[@amellperalta]

Great tutorial! Can you please make a video about the following interview question: Implementing autocomplete? I think you need to use a trie data structure.

[@ByteByByte]

that sounds really interesting actually. thanks for the suggestion

[@amellperalta]

Thanks.

[@tanthole0306]

this video is awesome. Thank you for the detailed explanation.

[@revdevstudios]

Beautiful job. This is really well done to help me improve in the interview process. Thanks!

[@ByteByByte]

That's awesome!

[@mcreyfonacier1982]

Is it fine to ask the interviewer to add "List neighborList" in the data structure, instead of 2d array?

[@guardianangel4514]

Could we use Kahs algorithm for this?

[@mayankmicky5]

thank you, life saviour ....can you plz make a video on Finding loop in a linked list

[@ByteByByte]

you're welcome! and sure, I'll take a look at that

[@Pooja_and_Abhay]

Amazing !! What an explanation :) :)

[@ByteByByte]

thanks!

[@vishalgawade94]

Can’t we just return permMarks set,instead of keeping one more set results!

[@TheNoNameUsername]

if im not mistaken, set doesn't guarentee the order of which you add elements like list does, and in this problem the end result relies on the order of which you add the processes

[@vishalgawade94]

Yup, you are right.That makes sense.Thanks a lot!

[@shilpita87]

Is this topological sort?

[@ByteByByte]

yep

[@Gerald-iz7mv]

@@ByteByByte can you use a queue and do it iteratively too or a stack?

[@karthikk5895]

Nice explanation! Which keyboard do you use?

[@ByteByByte]

I have a Das mac keyboard with blues

[@scarrevision6371]

should 2 be pointing to 1 and not 0 based on the example you provided

[@Abhishek-gl2pd]

at 21.45 why are we starting at 3 when i is iterating from 0??

[@ByteByByte]

We're just testing that it works for some arbitrary input iirc

[@Abhishek-gl2pd]

Okay Thank you, please keep making these videos its very helpful while interview prep.

[@Bhavya0409]

Great videos as always! Question: In an interview, when you're stressed and pressed for time, is it ok if you just find a solution, even if its not very good? Like, I can find simple solutions (like either the first or second solution you suggest in every video) but I'm literally never able to find the best solution. Is that fine?

[@ByteByByte]

Absolutely. That's always the best place to start and then you can also try to optimize your solution from there if you have time. Check out this post I wrote: www.byte-by-byte.com/brute-force/

[@krish0007]

awesome

[@jaydipbarvaliya]

I had skipped plethora of problem which is similiar to that., However after watching your tutorials and mainly this tutorial, my interest towards DS & Algo is really really escalating..

[@vibekdutta6539]

Sir, you're gr8, but I think there's some bug, I don't know if there is but please Sir could you please video conference with me on Skype or anything, I really want to learn coz I have some questions, I would really appreciate that, a big fan of your book and channel.

[@vibekdutta6539]

The code surely works, but there are some duplicate values like 0,1,0,2,0,1......

[@AbhriyaRoy]

Hi your algo wont work if there are multiple nodes without any dependencies.

[@ca3502]

dynamic programming better than recursion

[@ihopethiscommentisntabusiv4670]

Thanks for the video but instead of saying "Go research topo sort on your own" over and over again, it'd be more helpful if you explained it. Thats the point of people watching your video.