## Google Interview Question for Software Engineer / Developers

Country: United States
Interview Type: In-Person

Comment hidden because of low score. Click to expand.
1
of 1 vote

Assumption: While a pairwise intersection of corresponding pixels in the two images....Intersection is white iff both pixels of the pair are white.

Then you can do the recursive intersection as follows:
let A and B be to corresponding nodes in the two trees (or their subtrees)

``````if rootA.color == "black":
return A
if rootA.color == "white":
return B
if rootA.color == "gray" and rootB.color == "gray".
##Pairwise intersect the subtrees of A and B.
##If all four of the returned subtrees have a black root, return a single node tree with a black root.
Otherwise return a tree with a gray root and the four returned subtrees as its subtrees.``````

Complexity is O(min{|A|, |B|}).

Comment hidden because of low score. Click to expand.
1
of 1 vote

Could you provide some code please?

Comment hidden because of low score. Click to expand.
0
of 2 vote

Could you describe this question more specifically.

Comment hidden because of low score. Click to expand.
0
of 0 vote

It is a continuation of the previous question.
Define a quad-tree for a black and white image. Count the number the of black pixels.

Comment hidden because of low score. Click to expand.
0
of 0 vote

Name:

Writing Code? Surround your code with {{{ and }}} to preserve whitespace.

### Books

is a comprehensive book on getting a job at a top tech company, while focuses on dev interviews and does this for PMs.

### Videos

CareerCup's interview videos give you a real-life look at technical interviews. In these unscripted videos, watch how other candidates handle tough questions and how the interviewer thinks about their performance.