Thanks for taking time for the tech interview. It is an opportunity to show how well your programming skills and personalities are.

Usually, we have 3 - 4 rounds of interviews here at Dai Ke, which are,

1. Preliminary tech interview (this round, Skype/phone)
2. Advanced tech interview (1 - 2 rounds, Skype/phone)
3. Interview with the team (on-site)

In most cases, it takes 2 - 3 weeks for the complete interview process.

The preliminary test is base on some online judge sytem problems like LeetCode or ACM.

• Make your code correct, efficient (in terms of performance), and as simple as possible.
• Use any programming language of your choice.
• Please commit your code to Github, and send the repository URL back.
• For every question you complete, unit test(s) is REQUIRED.
• You only have one hour! Don't worry, most well-trained developer could do this.

Through this programming test, you should be able to demonstrate:

1. Good understanding of the programming language you use.
2. Good programming practices. Code quality and maintainability.
3. Good understanding of unit tests.
4. Apply suitable algorithm to solve the questions.

Should you have any questions, shoot us an email any time.

We highly encourage you to do so, even if you needed help solving the problems. Apart from examining your programming skills, we also want to see what it looks like working with you.

Given an array of n integers where n > 1, nums, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].

Solve it without division and in O(n).

For example, given [1,2,3,4], return [24,12,8,6].

Given an array nums, write a function to move all non-zero numbers to the head of it while maintaining the relative order of the non-zero numbers.

For example, given nums = [0, 1, 0, 3, 12], after calling your function, nums should be [1, 3, 12, 0, 0].

Note: You must do this in-place without making a copy of the array. Minimize the total number of operations.

According to the Wikipedia's article: "The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970."

Given a board with m by n cells, each cell has an initial state live (1) or dead (0). Each cell interacts with its eight neighbors (horizontal, vertical, diagonal) using the following four rules (taken from the above Wikipedia article):

1. Any live cell with fewer than two live neighbors dies, as if caused by under-population.
2. Any live cell with two or three live neighbors lives on to the next generation.
3. Any live cell with more than three live neighbors dies, as if by over-population..
4. Any dead cell with exactly three live neighbors becomes a live cell, as if by reproduction. Write a function to compute the next state (after one update) of the board given its current state.

Follow up:

• Could you solve it in-place? Remember that the board needs to be updated at the same time: You cannot update some cells first and then use their updated values to update other cells.
• In this question, we represent the board using a 2D array. In principle, the board is infinite, which would cause problems when the active area encroaches the border of the array. How would you address these problems?

Implement int sqrt(int x).

Compute and return the square root of x.

Implement pow(x, n).