# 谷歌 L3 西雅图挂经

Variation of Delete Node & Return Forest : https://leetcode.com/problems/delete-nodes-and-return-forest/
I didnt saw this question before, took me a while to get to solution but was able to get an approach & try on couple of examples. Intereviewer agreed on the approach & accepted the solution, by this time it was already 30 mins in to the call, I thought that was it, but he had one more…

https://leetcode.com/problems/maximal-square/ interviewer was eager to change the problem if I was going to take couple more mins. Which was weird given we only had 10 mins left.

3 days later I was told next phase will be onsite. 4 technical rounds + 1 behavioral.

Onsite

Again, first time I saw this problem.

Input: [1, 1, 2, 2, 2, 2, 3] target = 2
Output: 4
Binary Search was the first thing in my mind, (also gave some thought in using QuickSort Subroutine, but the array is sorted). The aim was to be able to do it in O(LogN). finding the target in LogN is straight forward I was trying to minimize the cost of the left & right edges. My Idea was to prune the search if the element is not found in one half, but keep recursively searching for the target by dividing the half in which we found the target & keep returning the sum of occurences. This in worst case is not O(LogN) when whole of the array is filled with target. Interviewer was friendly, laid back, had little input to give but Typed all of my code from white board in to the chromeBook. Which was very helpful in the end to review. I think among all the rounds I could have performed better here & got rejected due to this one.

Never saw this problem. Input as below if query is 3, return 4. You cannot use extra space.

``````	   0
/     \
1	       2
/           \
3             4
``````

I mentioned Level order as brute force interviewer asked to not use Level Order. I could think of having a parent pointer in each node & as we will be given the query node, we travel upwards with a depth variable which we keep increasing on going to the parent, when we find such parent who has a right child we attempt to find the right neighbor in this subtree, for doing this we pass in the depth variable & decrement it, if we are able to reach the same level (0) then we have arrived at the result node, this approach worked fine, there was some fine tunining required when we ran couple of examples. A very interactive session & I finally coded it in the chrome book & interviewer was satisfied.
Followup
As we had time, he added complexity to this problem, now every node has a maxDepth state with it, which is max of maxDepth of Left Child / rightChild + 1. How will you use this information now to our advantage. With maxDepth knowledge it became easier to prune the search & skip searching the subtree by just looking at the root of the subTree, coded it again, interviewer was very happy (at least i felt it). I think I did well in this round. but lets carry on to round 3 after lunch.

You can only add such char to the string so that it doesnt becomes a complete valid english word, but it should always be a substring of a valid english word.
If you cant add a char, then you loose. Game ends when a player looses
Game state is : “”
you cannot add ‘a’ , as ‘a’ is a valid english word, but you can add ‘c’ because its a valid substrig of [cat, cable, car …]
Game state is : “ca”
you loose, because now if you add ‘b’ thinking its a valid substring of “cable”, but this already becomes a valid english word “cab”
After my intial probing of questions, I suggested we can use Trie, in which we keep the dictionary of valid english words. As we cant have a subtree after having a valid smaller word, the trie should be sufficiently small. In trie node we also keep if this child is at the end of the termial word (valid word), then the Idea was fairly simple try appending any such char to the current state which is not a terminal word.

Game state is : “ca”
In order to not loose, i would append “f”, such that “caf” is still a valid subtring of “cafe”
Interviewer was satisfied with this approach ran several test cases, coded it!

Followup

Now we have to append such char which gurantee that we should win if there is atleast one way in which we will not loose on our turn. I tried to give approaches where either the game finishes in N-1 turns such that I dont get to play next turn, or we could color the trie & see if there a path in which the leaf node is not colored by my color then choose it. Interviewer wanted a probablistic approach, I tried couting of terminal nodes from the current state in all the paths & then returning the chance terminal / Nontermianl but it didnt added up. I believe this is a conditional probablity problem, with some Math wizardy. We ran out of time, I think it was average I did solved the primary problem but the extension was tough.

_ , _ , _ , _ , _ , _
E , X , _ , X , E , _
_ , X , _ , _ , X , _
_ , _ , _ , X , X, E

I think there is a similar question on leetcode, though I couldnt find it. The brute force was to fire BFS from every empty space & keep track of min when we have reached all Employees. The better approach was to fire BFS from every employee & keep the distances it has to travel in the grid & add them, after finishing BFS from all the employess the spots which have the least dist sum are the probable answers.
Explained, ran examples coded, interivewer was happy.
Several Followups, one was how would you scale it for parallel processing, my answers were, we can fire BFS in parallel but as each thread would try to update the distGrid, they run in to contention, so probably we need these many grids & then we can unify them later, another followup, thats costly in space, after some thinking I realised we dont need N copies of the distGrid, but all threads can share the same grid, but they would have contention on update a particular cell of the gird & one thread would have to wait. Several other followups on tests cases, general questions on google, Overall I felt good for this round, beacause of the breadth we covered.

• Tell me a time when you were not happy with the direction in which the project was going.
• What is the most difficult thing technically that you have worked on.
• What is your ambition, what sort of plan you have it for it.
• A time when you had to disagree with the team