"From my understanding, you could solve most of them using standard DFS + backtracking and if you manage to explain it well, it should be enough for a hire vote. Using classic algorithm like heirhoser is a plus but not a must" Context: https://www.teamblind.com/article/Graph-problems-OzZeSSHm by Amazon kudobear on Apr. 1st
Solves for Euler tour. It’s beautiful, check this out: https://m.youtube.com/watch?v=8MpoO2zA2l4
hierholzer’s algorithm