Algorithm interview course note 000 play-turn algorithm interview Leetcode the detailed analysis of categories

Algorithm Interview Course notes

===============================================================================

Address of this article:

===============================================================================

Liuyubobobo teacher << Game algorithm interview Leetcode question----Detailed analysis >>

Improve your algorithmic thinking for the interview

Http://coding.imooc.com/class/82.html

Course Catalogue :

The 1th Chapter algorithm interview in the end what is the ghost?

An algorithm interview, many students will be haunted. But in fact, most of the enterprise algorithm interviews, and not so scary. It is not necessary to chew the whole "introduction to the algorithm" in order to play the algorithm interview, not only ACM contestants, can be proud of the algorithm interview. On the contrary, most algorithmic interviewing focuses on algorithmic thinking, which is actually very basic. In this chapter, and everyone chat, algorithm interview, what is the ghost? ...

The 2nd Chapter analysis of the complexity of the interview

A lot of students mention the complexity analysis on the headache, immediately remembered the "Introduction to the algorithm" in the complex mathematical deduction. But in fact, in the General Enterprise interview, the complexity of the analysis requirements are not so high, but also the snag around the past. In this chapter, and you introduce the interview need to master the complexity of analysis. ...

The 3rd problem in the array is actually the most common

There are many algorithms in the interview that do not require complex data structure support. is to use the array, you can examine a lot of things. In fact, the classic sorting problem, binary search and so on, is in the array of the most basic structure to deal with the problem. In this chapter, we learn the common methods of dealing with problems in arrays. ...

4th. Finding table Related issues

Lookups are one of the most basic tasks when using a computer to process problems, and therefore are a very common type of problem in interviews. The essence of many algorithmic problems is to be able to find them efficiently. Learning to use the map and set in the system library has been half done.

5th chapter in the list of the needle-threading

The linked list is a special linear structure, because it cannot be accessed randomly like an array, so problems related to the linked list have his own characteristics. I call it a needle-threading. In this chapter, let's take a look at how to get a needle in a linked list.

6th stack, queue, priority queue

Stacks and queues are simple data structures, but the algorithm problems solved by using these simple structures are not necessarily simple. In this chapter, we will explore, and stack-related algorithm problems.

7th Chapter Two fork Tree and recursion

Recursion is an important way of thinking about using computers to solve problems. The binary tree has recursive properties because of its natural recursive structure, which makes the algorithm based on binary tree. Using a two-fork tree is the best way to get started with studying recursive algorithms. In this chapter, we look at recursive algorithms in binary trees. ...

The 8th chapter recursion and backtracking method

Backtracking is a common idea to solve many algorithmic problems, and it can be said to be the basic method of traditional artificial intelligence. Its essence is still the use of recursive methods in the tree-shaped space to find solutions. In this chapter, we take a concrete look at the use of recursive technology in non-binary tree structure, so as to understand the basic algorithm of backtracking. ...

The 9th Chapter Dynamic Planning Foundation

Many students hear that the name "dynamic planning" may be daunting, and that the problem of dynamic planning is complex. In fact, the nature of dynamic programming is still a recursive algorithm, but a recursive algorithm satisfying certain conditions. In this chapter, we will gradually unravel the mystery of dynamic planning.

The 10th Chapter greedy algorithm

Usually the students may think that the greedy algorithm is relatively simple. It is true that the implementation of the greedy algorithm is usually very easy, but it is important to be careful whether a problem can be used with greedy algorithms. In this chapter we look at what the greedy algorithm might be.

The 11th chapter of the course conclusion

After reading the whole course, I can't guarantee that all the classmates can answer the question of every algorithm interview freely, but the students who study seriously should have a reasonable thinking path to most problems. In the last chapter, we will briefly summarize, and wish every student can find their favorite job, Grand exhibition:) ...

Study Plan: 2018.03.13-2018.04.13 plan to cross a chapter every two days, one months after this video

Ryanjie

===============================================================================

The road long its repair far XI, I will go up and down and quest. Let's grow up together!

===============================================================================

Algorithm interview course note 000 play-turn algorithm interview Leetcode the detailed analysis of categories