I actually wrote a very similar article recently: https://algodaily.com/blog/does-studying-for-whiteboard-inte...

I'm not sure how people in the comments are saying that the "advanced stuff is never used", when the author used the A* search algorithm at work! I'm especially fond of this passage:

> You should also know about basic data structures that are pretty common, like hashtables, queues, or stacks. But specific algorithms like Dijkstra or A* are not ones you'd need to memorize: you'll have a reference for this, just like I had when implementing crypto.

Everyone complains about the lack of applications for these interviews, but there's not really an expectation to go beyond the fundamentals.