Nine chapters algorithm based algorithm enhancement algorithm system design Big Data android Leetcode HD video

LEETCODE 
Live video seminar video  
Nine-chapter algorithm video recording, PPT  
algorithm class, algorithm intensive class, Java introductory and Basic algorithm class, Big Data Project actual combat class, Andriod project actual combat class  
Nine-chapter algorithm download  
Nine-chapter algorithm interview  
Nine chapters algorithm leetcode 
Nine-chapter algorithm answer  
Nine-chapter algorithm mitbbs 
Nine-chapter algorithm class  
Nine-chapter algorithm ppt 
IX algorithm video  
Nine chapters algorithm training  
Nine-chapter algorithm micro Bo  
Leetcode video  
Nine-chapter algorithm to steal  
algorithm training  
Algorithm class syllabus:  
1 
Talk about interviewing skills and coding Style (free audition) from Strstr  
2 
binary search and rotate sorted array binary search & rotated Sorted array 
3 
Two cross-tree problem and divide-and-conquer algorithm binary trees & Divide conquer algorithm 
4 
Dynamic planning Dynamics Programming I  
5 
Dynamic programming ii 
6 
Linked list Linked list 
7 
Graph theory and search graph & search 
8 
data structure  data structure 
9 
High frequency Q frequency 
Intensive classes:  
1th Chapter Flag algorithm interview difficulty improved? How to prepare?

· The difficulty and style of interview algorithm for various IT enterprises
· How to solve the problem of middle difficulty and above algorithm
· If you resolve the follow up problem
· The sum of
1. Both sum follow up I
2. Both sum follow up ii-triangle count
· Kth largest element
1. K-major elements of the three-level progressive interview survey.
2. How to differentiate 3 types of interviewers through a topic
3. Analyze the interviewer's ideas of interview

The 2nd Chapter data Structure Data Structure (upper)
· and check Set
and the basic principle of the check set
And the related application of the check set
Expansion of the check set (with path compression)
And the application of the check set
· Trie Tree
The related application of Trie tree
· Scan line algorithm
General topics for scan lines
Expansion of the combination of scan lines and other data structures

The 3rd chapter data structure Data Structure (next)
· Deep understanding and application of heap
· Heap Important expansion:
Heap Hash-heap with Delete
Trapping Rain water
Building Outline
· Median Problem Development
· Sliding Windows Issues Summary
· Double-ended Queue deque

4th two Pointers two pointers
· Pair of hit-type hands
1. The Sum class
2. Partition class
· Forward Type pointer
1. Window class
2. Speed Class
· Two pointers on an array

The 5th Chapter Dynamic Planning (Upper)
· Memory Search (interval dynamic programming, game dynamic programming)
· Dynamic planning of Knapsack class
· Dynamic programming of Interval class

The 6th Chapter Dynamic Planning (under)
· Memory Search Extension
1. Interval Dynamic Planning
2. Dynamic programming of game type
· Dynamic planning of Knapsack class
BackPack I/ii
K sum
Minimum Adjustment Cost

The 7th chapter how to solve follow up problem
· Peak Element I/ii
· K Large
1. Section K
2. K-Large of ordered matrices
3. The K-Large of the product of two arrays
4. N number of K-size group
5. N Number group multi-machine K large (k relatively small)
6. N Number group multi-machine K large (k relatively large)
· Subarray sum
1. Subarray sum
2. Submatrix sum
3. Subarray Sum Closest
4. Subarray Sum II

This article is from the "12336926" blog, please be sure to keep this source http://12346926.blog.51cto.com/12336926/1877882

Nine chapters algorithm based algorithm enhancement algorithm system design Big Data android Leetcode HD video