Snapchat face Sutra and Snapchat face

Snapchat face Sutra and Snapchat face

Snapchat is headquartered in Venice Beach next to LA and faces the sea. It is actually a tourist attraction, and it is a pleasant experience. Internal staff think that this app is promising. It is from the United States and will become the next facebook. In addition, there are also a large number of Chinese employees, and there are not many Indians currently. It is estimated that there is a lot to do with the pressure. Welfare is good. Although it is just startup, there is also a gym, and the food is good, you can also set a green card. The company's layout is full of literature and art, which is very consistent with the style of LA. Although I have never used Snapchat, this company is quite fond of it. Because the location is not in Silicon Valley, it may be inconvenient to change jobs in the future.

Snapchat's interview requirements are to be compiled and run self-written tests. The requirements for coding capabilities are still high. When writing an Onsite, you do not need to write it on the whiteboard. It is very helpful to install an IDE and write code on the whiteboard. HR is very efficient. I have dug it from G's house and told us where to play.

Google Hangout is used for electrical purposes, and videos are required. The videos of the two men are strange. The question is to give an integer array where all numbers are greater than or equal to 1. These numbers can be connected to an expression using the plus sign, multiplication sign, and parentheses to calculate the maximum value of the expression. Two-dimensional DP.

Follow up is regarded as 0 and negative. In this case, you need to maintain two DP tables and track the maximum and minimum values of expressions at the same time. In an age that is no longer popular with DP, this topic is the most difficult DP topic for all my interviews.

There are four rounds of Onsite, including a Chinese, an ABC, and two white people. At noon, a senior-level Chinese girl accompanied her for dinner. I felt that the interview team was really good.

The first is the original LC question. A binary tree is constructed based on pre-order traversal and mid-order traversal. follow up is used to detect illegal output. I have never thought about follow up before. It turns out to be quite interesting.

There are two questions on the second side. The first question is Amicable pair. I only gave the brute force solution of O (N * sqrt (N), but Tom is very satisfied, he said this is already the best solution he knows. The second question is how to implement the dictionary tree.

The third aspect is the implementation of Bipartite. Although I have forgotten all the graph theory knowledge, the White manager patiently guided me and ruled out some of my wrong ideas (for example, I want to trace back while BFS ), then debug it on your own, and the main test cases have passed. However, because debug took some time, there was no follow up. It is estimated that this round will be suspended.

The fourth aspect is the implementation of the BigInteger class, which mainly implements addition between bigintegers. Since both positive and negative numbers must be considered, we need to calculate the opposite number and subtraction here. The idea is not difficult, but there are still a lot of code and a lot of test cases, but they are all tested correctly.

After the interview, I felt quite good. After all, I wrote all the questions and passed the test cases. I didn't expect to be rejected at the end. It seems that I had to go to Silicon Valley.