Interview with Zynga
Interview with Zynga Q1. Implement the search for the closest common ancestor of two tree nodes. Q2. Write a method that recieves queen postions on a chess board and returns true if the queens are attacking one another and false otherwise. Q3. Write a hash table implementation. Q4. Bank of a web servers, tiers of caching, dealing with connection fan-in, etc (Do you understand systems and networks, not just FOR loops). Q5. Huge bank of servers is punding data layer with connections. What do we do? Q6. Implement a Hashtable. Chaining / Linear-probing, hash stuff. Q7. Writing code to perform a binary search, determining max depth in binary tree. Q8. How do you find the max depth of binary tree? Q9. Write a class that does search and delete on a BST. Q10. Implement tinyurl. Q11. Write a function that calculates the degree between the minute and hour hand of a clock. Q12. If there was a feature you only wanted to show to 10% of the users, how would you do so ? Q13. Design a...