Lowest Common Ancestor (LCA) Problem | Eulerian path method

From a channel Lumen includes in full: William Fiset's graph-theory and data-structure lessons walk through each algorithm (network flow, SCCs, shortest paths, dynamic programming, suffix arrays) and then its source code; a widely used companion for algorithms courses and competitive programming.

A 17-minute video from WilliamFiset's catalogue; the title names its topic.

Video by WilliamFiset, played through YouTube's embedded player.