topological sorting is surprisingly useful in warehouse logistic and manufacturing as well. Component manufacturing process and item stacking can be represent as an acyclic directed graph
@potatocoders20283 жыл бұрын
I didn't know that!
@MrPoncho90004 жыл бұрын
Great explanation, I especially liked how you changed your solution from returning a boolean to the actual topological sort order with just 3 small changes.
@potatocoders20284 жыл бұрын
Made our day, thanks 😀 please feel free to give recommendation for any other content that you would like us to cover
@MrPoncho90004 жыл бұрын
@@potatocoders2028 How about quick select algorithm to solve the problem of "Find the K most frequent elements in an array". The min heap O(NlogK) solution is pretty intuitive, but quick select is optimal (and also much trickier to understand!). Thanks for the content.
@potatocoders20284 жыл бұрын
Yes we will definitely try to cover this! Thanks for suggesting the content idea.
@markomekjavic2 жыл бұрын
Really love your explanation and your simplistic code! This is by far the best video content on the topic I've seen so far, many thanks!
@samantha94602 жыл бұрын
Good job, your explanation made a lot of sense! I tried watching or reading other solutions, they were all confusing to me.
@sofoboachie52214 жыл бұрын
My God what a voice! You earned a sub
@potatocoders20284 жыл бұрын
Thank you! Happy to hear that you enjoyed the video