Google

Very good, organized, difficult questions but not impossible. There were 4 DS and algorithms and 1 behavioral (Googleyness). The questions covered a good mix, including trees, graphs, binary trees, linked lists, and data structures. Lots of good f

After resume screening, I was called upon for two technical rounds scheduled in a single day. One was a coding interview, and the other was a systems engineering interview.

Tree/Graph Traversal: * Find the path between two nodes in a binary tree. * Calculate the maximum path sum in a binary tree. * Determine the number of islands in a grid or tree structure. Build a prompting engine that can improve itself without any