第一轮
- Design the 2048 game. Given an 2D array with input based on up, down, left, right movement what would be the output after 1 iteration.
第二轮
第三轮
- Given a number N check if N nodes exist in a complete binary tree
第四轮
- Variation of https://leetcode.com/problems/bomb-enemy (premium)
Given a 2D array with F for Flowers and R for Rocks and Blank for empty spaces. If you were to stand at a spot, find the max possible flowers visible in your line of sight. Image rocks are too high and obstruct line of vision.
At the position X your field of vision has 3 neighboring flowers. Flowers only count if its in top, left,down, right directions
第五轮: [Googleyness and Leadership]
- If your team has stopped being innovative, how would you change it?
- How would you work with team mates of different workstyles?
- What is important to you that the company does to have you work for them?