Zynga Interview Experience | Set 1

Round 1 (F2F 1.5 hour)

• OS concepts – semaphors and fork
• Average of two numbers , how do you handle over flow? and generalise the same for stream of numbers https://www.geeksforgeeks.org/average-of-a-stream-of-numbers/ and
  https://www.quora.com/How-can-I-compute-the-average-of-a-large-array-of-integers-without-running-into-overflow/answer/Umesh-P-Narendran?srid=icYD
• Check if binary tree is symmetric ( structurally as well as value) http://www.geeksforgeeks.org/symmetric-tree-tree-which-is-mirror-image-of-itself/
• missing number in array of n numbers – solved using xor
• write a function for isPrime – O(?n) complexity
• In client and server model, how to decrease reponse time – discussed various methods

Round 2 (F2F 1 hour)

• what is REST? what could be the ways implemented before REST?
• how authentication works? – discussion on cookies, OAuth
• find all pairs that add up to give sum k in array of numbers
• how hash works when key is a string?
• what are advantages of sql and nosql dbs, distributed system concepts like sharding, replication, master-slave

Round 3 (F2F 1 hour)

• discussion on projects
• what is priority queue and its implementation – heap with array
• detect and find loop in linked list

Round 4 (skype interview)

• remove duplicates in sorted linked list – they check the coding practices and make sure you go through and discuss the code with all test cases