Google L4 Interview Questions | Hyderabad
Summary
I interviewed for an L4 position at Google in Hyderabad, completing a phone screen and two onsite rounds that involved a complex linked list problem and two LeetCode-style questions.
Full Experience
Phone Screen Round A linked list problem where each node contains a value, a next pointer, and a hash computed using the current node’s value and its next node.
Tasks included:
Insert a node at the head of the list
Validate the linked list by traversing and verifying the hash of each node
Inserting a node at position k using recursion (which requires updating the hash values of all nodes from position k up to the head)
Onsite Round 1 https://leetcode.com/company/google/discuss/1682632/Google-or-Phone-Screen-or-Number-of-Islands-in-a-Tree
Onsite Round 2 https://leetcode.com/discuss/post/4156836/merge-intervals-with-names-by-anonymous_-pbnz/
Interview Questions (3)
A linked list problem where each node contains a value, a next pointer, and a hash computed using the current node’s value and its next node.
Tasks included:
Insert a node at the head of the list
Validate the linked list by traversing and verifying the hash of each node
Inserting a node at position k using recursion (which requires updating the hash values of all nodes from position k up to the head)