# Interviewed in Dublin, County Dublin ﻿(took 4+ weeks)

Interviewed Apr 2009 in Dublin, County Dublin ﻿(took 4+ weeks) Applied online, after which it took about a month for Google to get back to me regarding interviews. First interview with recruiter who did a background check after which she informed me of two additional interviews: the interviewers were from the same market; one of them wa... [More]

# Full-time Software Engineering position after graduation

I interviewed at Google for a full-time Software Engineering position after graduation. As I informed the recruiter that I had a pending offer already, they skipped the initial interview and brought me in for a full-day interview. I met with 5 engineers: two 45 minute interviews, an hour lunch, and two more 45 minute interviews. There ... [More]

# Hacking a Google Interview Practice Questions – Person B

Tags: | Posted by Admin on 9/13/2009 11:11 AM | Comments (0)
Question: Binary Search Tree Validity Write a function to determine whether a given binary tree of distinct integers is a valid binary search tree. Assume that each node contains a pointer to its left child, a pointer to its right child, and an integer, but not a pointer to its parent. You may use any language you like. Good Answer: Note t... [More]

# My own solution for "Pirates questions"

You have five pirates, ranked from 5 to 1 in descending order. The top pirate has the right to propose how 100 gold coins should be divided among them. But the others get to vote on his plan, and if fewer than half agree with him, he gets killed. How should he allocate the gold in order to maximize his share but live to enjoy it? (Hint: O... [More]

# Hacking a Google Interview Practice Questions – Person A

Question: Substring Write a program to determine whether an input string x is a substring of another input string y. (For example, "bat" is a substring of "abate", but not of "beat".) You may use any language you like. Sample Answer (in C++): bool hasSubstring(const char *str, const char *find) { if (... [More]