would it be possible to share in which office you did the interview? thanks!
rk
@rabeeh
Posts made by rabeeh

RE: Plane Sweep To Solve a hard Google Onsite Problem @08/10

RE: Line reconstruction by height
I did not get the question, could you please explain more? I wonder why the reconstructed line is:
[(5,0), (7,0), (5,2), (6,1), (4,4),(7,1)]
since it is 7,5,6,7 in front of the first 5, then it should be (5,4). Isn't it? thanks 
RE: Google Onsite Problem set
can you please also post the question above it? thanks a ton!

Find shortest word for a licence plate
Find shortest word in a dictionary that contains letters from a licence plate.
We look at licence plates and try to find a word from the dictionary that includes all the letters from the licence plate. The shorter the word, the better. The licence plates start with two or three letters, then they are followed by 5 characters, from which at most 2 are letters, the rest are digits.
Your goal is to write code that will find the shortest words for 100 licence plates. You are given a dictionary.
E.g. for the licence plate "RT 123SO" the shortest word would be "SORT", for "RC 10014": "CAR".[The good questions to ask to clarify]
 how to treat duplicate letters? (keep)
 are spaces and digits necessary? (drop them)
 should the letter order be preserved? (no)
 what case are the plates and the words from dictionary? (plates upper, dict mixed)
 is the dictionary sorted? (lexicographical order)  how large is the dictionary? (~ million entries)

RE: Merge two images
I got this question like this, we have two black and white images of the size of (2^n)*(2^n), then each of them is represented as a quad tree, in which if the colors of one section are all the same, they are compressed to one node, the goal is compute a tree which is the intersection of two given the rule that intersection of white and black is black, as a sample, see the example below, you need to do a recursion on both trees at the same time, you should note that this special case that if one section is complement of the other one, then it needs to be represented as a compressed node, so if one is BBWB and the other one WWBW this is B.
[0_1482869385540_aks 27Dec2016 210813 Page 1.pdf]df)>! ~~ Spoiler~~~~>! strikethrough text~~
strikethrough text
 Spoiler~~~~>! strikethrough text~~

Judge is pending for me.
Hi,
when I submit my codes, judge keep being pending, I wonder if anyone has how to solve it.
Thanks.