Online Assessment (OA): Two algorithmic coding questions on platforms similar to HackerRank or CodeSignal. Topics included data structures (arrays, strings, graphs) and complexity analysis. The key challenge was writing clean, efficient code within 90 minutes.

Technical Phone Interview: Conducted by a Google engineer via Google Meet. Focused on problem-solving and communication — one medium-level LeetCode-style problem plus follow-up optimizations. The interviewer expected clear thinking, complexity trade-offs, and edge case handling.

Onsite (or Virtual Onsite): Comprised of 3–4 rounds:

• Algorithms & Data Structures: Dynamic programming, graph traversal, and binary trees.
• System Design (for experienced candidates): High-level design of scalable systems and trade-offs.
• Behavioral (“Googliness”): Collaboration, learning attitude, handling ambiguity, and leadership without authority.

Hiring Committee & Offer: Final evaluation based on technical performance, problem-solving depth, and teamwork culture fit. Takes about 1–2 weeks.

Arrays and hash maps.

Recursion and dynamic programming.

Graphs and shortest path.

Design patterns for embedded or performance-oriented systems.

Coding in C++ / Python / Java (depending on preference).