First question: Classic in classic!

First question: Classic in classic!

-- Comment on the beauty of Programming

Original post address: http://www.douban.com/review/2130819/

I have received this book almost two months ago, and I have only recently taken the time to read it. The first question at the beginning of this book has now become a classic one, I believe that many people have bought this book because of this question of CPU usage control. After reading this book, I also believe that people who have bought this book should think it is very worthwhile, data structures and algorithms have become a key element in writing programs that reasonably meet requirements, high performance, and large data volumes. This book uses a short question to review some classic algorithms.

First of all, this book attracts many people's dreams with Microsoft interview questions. After all, there is no doubt that Microsoft has a strong technical skills. I have interviewed many people and feel that the interview questions are really very difficult, after all, the interview requires the interviewer to check whether the interviewer meets the company's requirements in just a few minutes or hours, in the preface to "the beauty of programming", I saw Yan Xin think of the classic question about CPU usage control when interviewing a interviewer who has conducted a CPU stress test, from this question, we can see whether the interviewer is proficient in a technology, I think it is similar to the articles I wrote earlier about how to test whether the subject has achieved proficiency. After all, being proficient in these two words cannot be achieved at will, from the book "The beauty of programming", I also saw that Microsoft's requirements for the ability to test the interviewer are very high, which completely overturned my views on Microsoft's Asia Research Institute ,, in addition, from some of the questions listed in this book, we can see that the level of Microsoft's interview questions is indeed quite high, and we can fully examine the interviewer's ability in this aspect in a short time, I think this is what most interviewers should try to achieve when they come up with questions.

From the perspective of the interview questions, let's take a look at the content of this book. It is estimated that many of the questions in this book have become the focus of discussion in the industry, such as CPU usage control, dual-thread download, sudoku game, elevator scheduling, and even viewing, these questions should be helpful to correct the opinions that many industry practitioners do not pay attention to data structures and algorithms. When I am developing applications for small and medium enterprises, I have always thought that data structures and algorithms do not matter even if they are not mastered. Now I also pay great attention to data structures and algorithms. Now, when I am doing an interview, I will ask about the performance of data structures and algorithms. The other point in the book is that mathematics is very important. There is no big difference between programming and solving equations when we are learning mathematics, therefore, I think that most of the good mathematics students are suitable for the software industry. They are only personal opinions, and many classic questions are listed in mathematics, such as searching for "Water King" and searching for the maximum and minimum values in the array.

In general, this book does not mean to tell you how to interview Microsoft and memorize these answers. It makes little sense, after all, the interviewer is actually examining the Logic Thinking Ability of the interviewer and the mastery of relevant knowledge. What's more, the interviewer usually adjusts the question, not to say that each question is the same, I think the most useful reference of this book is to understand what is truly proficient. In addition, it also shows you why data structures and algorithms are fundamental to programs, for programs that require high performance and massive data processing, this is even more critical. Therefore, in addition to this book, books related to data structures and algorithms should be carefully studied, even if they are not from a division.