In this statement, writing a pen by yourself is only for learning and sharing. The company name was not written for leaks. This is also a respect for companies that offer test opportunities! Thank you!
We hope that our records will help us better understand the technical requirements of e-commerce companies for candidates (based on R & D/algorithm posts), as well as their depth and breadth. At the same time, I also hope that a little bit of light and heat will help you!
There are three parts: 1. single choice. 2. You can select any option (select 5 for each option and leave 2 for missing items ). 3. Fill in the blanks or ask questions.
I. Individual Items
1. Learn about the shortest path and dijskra. wallshell algorithm.
2. a matrix of mxn is known. The elements on the diagonal line increase sequentially and all of them are greater than the elements on the row and column where mxn is located. The time complexity of the optimal algorithm for finding any element is required. .
3. A question about Drawer principle. There are 5 black balls, 10 white balls, and 17 red balls in the bag. Each time two balls are taken out of the bag, after you ask how many times, a pair of balls will be in the same color. 16 times later.
4. There are two people in a logic question, either a knight or a liar. The server guard only tells the truth, while the scammers only say false things. One of them is determined by one of the options as a knight and a liar.
Ii. Option Selection
1. There are four server A, B, C, and D serving as the Server Load balancer. When a task comes, it will be processed. The allocation ratio is 1: 2: 3: 4. Their stability is 90%, 95%, 98%, and 99.5%, respectively. When a task encounters a problem, the server on which the task is most likely to occur (assuming only stability factors are taken into account) is a, B. (1 * (1-90%) = 2 * (1-95%)
2. TCP three-way handshake knowledge point. (Both in two or three written tests, important) errors that may occur when a TCP connection is not established: Last, fin_wait, and so on.
3. logic questions. There are two members, each of which has 6 yuan and 8 yuan. 10 yuan on the road. They plan to decide who gets it through the auction. The high bidder will get the 10 yuan, but at the same time, the current amount of the auction price corresponding to the other party must be given to the other party. If the bid is the same, it is determined by throwing a coin. (For example, if both of them make a RMB 1, then the coin is thrown to determine the 10 yuan that a receives. He needs to give his 1 yuan to B ). The premise is that both of them want to make as much money as possible. Ask about the possible outcome.
Option: the amount of money the two earn is the same; Party A will lose money; Party B will lose money; and both will make money. If you have any answers to this question, please leave a message. I am not sure the answer to this question.
Iii. Fill in and answer questions
1. Fast sorting algorithm, two-way sorting of C code implementation.
2. logic questions. It is known that a monster suddenly falls in front of a group of crocodiles. These crocodiles are very hungry enough to swallow them. However, eating consumes physical energy. It may be swallowed up by other crocodiles during eating. They all want to swallow monsters while ensuring their safety. Will monsters be safe? Why? .
3. An array a [1]... a [I]... A [n] is known. They are arranged in ascending order. Find the number of all a [I] = I. Write out the algorithm and analyze the time complexity of the algorithm.
4. In the address bar of the browser, enter the company website address and press the Enter key. What are the actions? (Including browsers, TCP, UDP, servers, parameters, etc., the more the better)
