1 HR interview and 2 Technique interview. Ask some questions about STL, C++, OS, Network and Algorithm. The hardest puzzle is a optimal stopping problem. There're some diamonds outside the door of every floor, you go through from bottom to top, can see the amount of diamonds of every floor, but can only pick once, how to maximum the expectation of diamonds you'll get.