Total years of experience: 10 months
Date: 29th April 2020

First Round

1. What is a heap? Time complexity of insertion in a heap.
2. How will you balance a BST? What is AVL Tree?
3. 1-d dp question
4. How will you design snakes and ladders? How would you calculate minimum number of steps so that you can win?
5. Work experience related questions

Second Round

1. What is a hashmap? How do we handle collisions?
2. Given a nested list of json -

{
	x: {
		value: 3,
		children: {
			q: {
				value: 8,
				children: {}
			},
			m: {
				value: 9,
				children: {
						l: {
							value: 4,
							children: {}
							}
					}
				}
			}
}

find sum of values weighted till some level, for example -
level 3 - 4 (has l)
level 2 - 8 + 9 + 4 = 21 ( q + m + l)
level 1 - 3 + 8 + 9 + 4 = 24 ( z + q + m + l)

Solved using recursion & appropriate data structures like map.
3. Resume related questions, discussions on past internships.

4. Why leaving your past job before a year?
5. Why Zynga?

Third Round

Design autocomplete feature with proper oops design prenciples & production ready code. Discussed various edge cases as well.
https://leetcode.com/problems/design-search-autocomplete-system/

Overall had a great experience, interviewers were friendly and helpful. Accepted the full time offer as SDE-1.