A front end face questions (data structures and algorithms)

(The front end face questions Encyclopedia, continuously updating)

1. Binary search
2. Binary tree insertion
3. Handwriting quick drain (complexity)
4. Divide and Conquer Algorithm
5. Code for determining a string line palindromic
6. Heapsort
7. Jump stairs (one-step or two-step how many ways)
8. top K (find the number inside the k-th largest number)
9. email regular match, url regular matches (two faces on three sides and have written again)
10. How array of digital de-emphasis maximum efficiency, complexity is how much?
11. This time if the array contains a string of numbers and how they should go to weight, complexity is how much?
12. Reverse list, do not apply extra space
13. Before and after the binary tree traversal sequence, the sequence is known before seeking the original binary tree
14. Why write a program logical address and physical address
15. Increasing odd, even field sorted list
16. Binary tree node taken from the left to see
17. List penultimate k nodes
18. Analyzing string matching, s and p include? * Matches any arbitrary number of matches
19. Ordered array of merger
20. Coin issue
21. And looking for a binary value of all the paths
22. All kinds of sorting algorithms introduced, bubbling, fast row, heap row, and the corresponding complexity of the algorithm
23. It describes the basic structure and application data, queue, stack, heap. The execution stack and heap memory function
24. Function queue (FIFO), in order to achieve the first 100 seconds after printing 2,300 prints out second after printing 1,200 3 seconds so
25. Realize the function is similar to the template string
26. Breadth search
27. Into a rectangle to a square of the same size, the maximum side length is much