Round 1 (Phone Screen): Given an array of integers, find the length of the longest subarray with sum equal to 0. (Used prefix sum + hashmap approach.)

Round 2 (Technical Interview): Given a binary tree, return the diameter of the tree (longest path between any two nodes). (DFS recursion based solution.)

Round 3 (Technical Interview): Design a data structure that supports insert, delete, and getRandom in O(1) time. (Implemented using HashMap + Array. Follow-up: handle duplicates.)

Round 4 (Final Technical + Behavioral): Behavioral questions on teamwork and problem-solving. Coding: Word Ladder problem – Given two words, return the shortest transformation sequence length using BFS.

Round 5 (Managerial Round): Scenario-based questions on handling conflicts, prioritizing tasks under deadlines, and managing dependencies across teams.

Round 6 (Hiring Manager / HR): Behavioral round covering career aspirations, why Google, strengths/weaknesses, and cultural fit questions.