1462. Course Schedule IV | Topological Sort | Kahn's Algorithm

[@ARYANMITTAL]

Course Schedule (Famous Problem) - kzbin.info/www/bejne/bZPSZ5-hodujh6s But getting this in an Interview, we would be self doubting our most Optimal Solution 🫣

[@mohammedajmal4264]

Thank you 😊

[@coder6109]

Hi @aryan why cant we solve this by first forming a map of the toposort array (element,level in the toposort) so if for (a,b) if map.get(a) is less this means this comes first in toposort but 1 things is left how will this ensure that a,b are connected or not so can use DSU for that so wont then time complexity by just (n^2) i.e. of toposort and dsu just takes ~ o(1) Please suggest am I correct ?

[@shyamaharihar2425]

Explained well !

brother where is 3435. Frequencies of Shortest Supersequences

[@vishalbairagi7238]

thanks bhaiya 🙏

[@VIDITSHRIMALI-l8o]

code quality

[@aryamukherjee4122]

Topo sort is fine but dfs also works right given the bound is only 100 ?

[@BCS-IshtiyakAhmadKhan]

Yes