Meeting with HR, then a 30-minute presentation to a panel of engineers on a project I worked on, followed by 30 minutes of questions and answers. Pretty straightforward. I felt well-prepared for the presentation, they gave us some info beforehand on the type of info we should focus on.

Master different graph representations (adjacency list, adjacency matrix) and algorithms (Dijkstra's, Bellman-Ford, A* search algorithm). Understand how to solve complex problems involving graph traversals, shortest paths, and cycle detection.Go beyond binary trees to understand AVL trees, red-black trees, segment trees, and B-trees. Learn about tree traversals, balancing techniques, and applications in databases and filesystems.

I had two interviews for two different internships. One had me do a technical presentation and the other was very casual, a few questions. Both were incredibly nice, HR was very helpful.