Google
4.2 of 5 2,087 reviews
www.google.com Mountain View, CA 5000+ Employees

Google Software Engineer Interview Question

I interviewed in Mountain View, CA and was asked:
"For future applicants, you need to get all rounds straight. I kind of flunked 3rd round."
Add Tags [?]
Answer Flag Question

Part of a Software Engineer Interview Review - one of 2,770 Google Interview Reviews

Answers & Comments

3
of 8
votes
I guess by BTree you mean Binary Tree, not B-tree:
http://en.wikipedia.org/wiki/B-tree
- Anonymous on Oct 17, 2013 Flag Response
1
of 1
vote
I guess by BTree you mean Binary Tree, not B-tree:
http://en.wikipedia.org/wiki/B-tree
- Alyssa on Dec 10, 2013 Flag Response
1
of 1
vote
For Round 3 question, does it depend on the network structure those N machines reside? If it is a hypercube network, and no constraints, the time should be O(logN)?
- Anonymous on Jan 29, 2014 Flag Response
0
of 0
votes
depends on bandwidth, the log base should be bandwidth/(copy frequency), in other words, the number of children of each node depends on bandwidth/(copy frequency).
- Anonymous on Feb 19, 2014 Flag Response
2
of 2
votes
For Round 3 question if you look at the bandwidth constrains as weights, then aren't we looking for a path that covers all nodes (kernel machines) (a variant of TSP)?
- Anonymous on Feb 24, 2014 Flag Response

To comment on this question, Sign In with Facebook or Sign Up


Tags are like keywords that help categorize interview questions that have something in common.

Glassdoor is your free inside look at Google interview questions and advice. All interview reviews posted anonymously by Google employees and interview candidates.