Classic algorithm Problem List _ Classic

0.0 Basic Primer

Coding interview Exposed (3ed) This is the simplest, the base of the comparison can start from here

"This book is not" textbook ", not" curriculum ", but teaches you to do all kinds of common interview topics. Mastering the content of this book is the basis of your job search. ”

Programming Interviews Exposed 8.0/60 | Programmer Interview Strategy 7.7/86

MIT's Hacking A Google interview (also very simple)

1. System learning-can not be satisfied with the solution, complexity analysis as important

Careercup is not difficult, refer to the focus of the two master strokes, start early, even before starting to do the first few chapters simple.

Cracking the coding interview V5 8.9/88

Challenge Program Design Competition 9.0/72

The beauty of programming 8.3/2289

Sword refers to an offer 8.3/159

Programming Zhuji 9.2/1215

Complexity analysis to be good at summing up, you may wish to look at the algorithm of the ranking algorithm, a picture wins thousand words

2. Real problem-time is limited, coding true question practicing is the most direct.

The best textbooks are naturally careercup (similar sites and Glassdoor)

3. Oj-bug Free&code style is more important than overcoming puzzles.

OJ has feedback to hold the handle, and not even a Google interview is too difficult for non-ACM players

Leetcode's problem is slightly more difficult, but very interesting, you can refer to this difficulty coefficient table brush (with the end of the article has attached), there is a tips (North America job search Group master Classification solution/Nine chapter answer/maskray answer)

Codility has classification, can exercise extrapolate ability, more suitable for getting started than Leetcode

Nine degree online Judge (based on "sword means offer")

If you have the power, there are many OJ websites:

Interviewstreet (written test platform for some overseas companies)

Projecteuler

Google code jam Google can do

Lintcode of the nine-chapter algorithm

Hihocoder

51node

ITint5

The hero will

4 CV and Behavior question

What A Good Resume Should look like

The Google Resume 8.2/38 | Golden Collar Resume 8.2/20

Behavior question, prepare some similar to self-introduction, why XX Company type of on the line, others know how to answer on the line. http://hrinterviews.blogspot.com/(64-way behavior questions).

5. System Design

A summary of the thinking of the system design face questions

Basic knowledge Finishing

Consistent hashing algorithm and its application in Distributed system in addition, the Careercup book large scale and the object-oriented chapter is very good

6. Information

Water Wood Community-campus recruitment

Bupt People Forum-graduates looking for jobs

Fresh students-Machine learning School recruit Beijing

An acre of three points-inward push

7. Network resources

TopCoder Tutorials

The way of structural algorithm July blog

The new Book of programmer July Art

Sword refers to an offer: Famous business interviewer He Haitao's blog of typical programming questions

Python Face Questions Collection

An acre of three points to stay in the United States job tips Warald

Mitbbs's jobhunting version (FQ required)

The MIT algorithm introduction Open Class Learning program, matching the selected ACM questions

How to rank the Internet IT jobs in the following categories of companies

Master Code of Agricultural offer grade (Personal Edition)

8. Other available (Shao) (Qian) Books

Dahua Data Structure 8.1/336

The design pattern of Dahua 8.3/1139

Brother Bird's Linux private dish. Basic Learning Chapter 9.1/1097

UNIX Environment Advanced Programming 9.4/1531

UNIX Programming Art 9.1/1651

Everyone has a good job 7.9/45

Who are the people Google wants 7.4/195

The peak of the Tide 9.1/10221

Hacker and painter 8.8/7032

Dark Time 8.5/4871

Programmer Interview Treasure 6.1/118 (strongly tyrants buy this to burn money ...) There are many mistakes, find is to make a profit)

Reference:

Http://www.1point3acres.com/bbs/thread-50411-1-1.html

Http://www.zzsec.org/tags.html#leetcode-ref

Report:

Leetcode questions Id question difficulty freqency Data structures Algorithms 1 two Sum 2 5 array, set sort, two poi Nters 8 String to Integer (atoi) 2 5 string Math Valid parentheses 2 5 string stack Merge two Sorted Lists 2 5 linke D list sort, two pointers, merge Valid number 2 5 string math climbing Stairs 2 5   DP merge Sorted Array 2 5 array Two pointers, merge Valid palindrome 2 5 string Two pointers 3Sum 3 5 array two pointers Pow (x, N) 3 5 & nbsp Binary search, Math Set Matrix zeroes 3 5 array   Validate binary search Tree 3 5 tree DFS 127 Word Ladder 3 5 Graph BFS, Shortest path implement STRSTR () 4 5 string Two pointers, KMP, rolling hash Merge intervals 4 5 array, Li nked list, Red-black tree Sort, Merge inserts Interval 4 5 array, linked list, Red-black tree sort, merge Remove Elem ENT 1 4 Array Two pointers Roman to Integer 2 4   Math-Swap Nodes in pairs 2 4 linked list   ADD Binary 2 4 String Two POInters, Math 129 Sum Root to Leaf Numbers 2 4 Tree DFS 2 Add two Numbers 3 4 linked list two pointers, math Integer to Roman 3 4   Math Generate parentheses 3 4 string Dfs Merge K Sorted Lists 3 4 linked list, heap sort, two point ERs, merge permutations 3 4 array permutation anagrams 3 4 string, Hashtable   combinations 3 4   Combi Nation subsets 3 4 array recursion, combination a Word Search 3 4 array dfs Decode Ways 3 4 string recursion, DP 10 2 Binary Traversal 3 4 tree BFS 131 Palindrome Partitioning 3 4 string Dfs Sqrt (x) 4 4   Binary s Earch Remove duplicates from Sorted array 1 3 Array two pointers-remove duplicates from Sorted List 1 3 linked list   112 Path Sum 1 3 Tree dfs 7 Reverse integers 2 3   math Remove nth Node from end of List 2 3 linked List two Pointers Unique Paths 2 3 array DP 108 Convert Sorted array to Binary Search Tree 2 3 Tree DFS-letter combinations of a Phone number 3 3rdRing DFS combination Sum 3 3 array combination Maximum Subarray 3 3 array dp-Unique Paths II 3 3 array DP Mum Path Sum 3 3 array DP search a 2D Matrix 3 3 array binary search duplicates from Sorted List II 3 3 linke D-list recursion, two pointers Partition list 3 3 linked list Two pointers the Restore IP Addresses 3 3 string Dfs C Onstruct Binary the preorder and inorder Tr 3 3 array, tree DFS, construct Binary, and Inorder T 3 3 Array, tree DFS 114 flatten Binary-linked List 3 3 tree recursion, stack 116 populating Next right pointers In each Node 3 3 tree dfs Divide two integers 4 3   binary search, math search in rotated Sorted Array 4 3 arr Ay binary search for a Range 4 3 array binary search Multiply Strings 4 3 string two pointers Wuyi N-queens 4 3 Array Dfs n-queens II 4 3 Array Dfs Distance 4 3 string DP Binary tree inorder traversal 4 3 tree, HASHTABL e recursion, Morris, STACK Binary tree Zigzag level order Traversal 4 3 queue, tree BFS, stack 109 Convert Sorted List to Binary Search Tree 4 3 Linked list recursion, two pointers 128 longest consecutive Sequence 4 3 array   130 surrounded regions 4 3 array BFS, DFS 132 palindrome partitioning II 4 3 string DP 4 Median of two Sorted Arrays 5 3 array binary search Regular EXP Ression Matching 5 3 string recursion, DP wildcard Matching 5 3 string recursion, DP, greedy bayi Search in rotated sorte D Array II 5 3 array binary search Plus one 1 2 array math symmetric tree 1 2 tree dfs balanced binary Tree 1 2 Tree DFS 9 palindrome number 2 2   math Search Insert Position 2 2 array   Valid Sudoku 2 2 array   Count and Say 2 2 string two pointers Remove duplicates from Sorted Array II 2 2 Array two pointers 113 Path Sum II 2 2 Tree Dfs 3 longest Substring without repeating Characters 3 2 string, hashtable two pointers-Container with Most Wa TER 3 2 Array two PointeRS 4Sum 3 2 array   Jump Game 3 2 array   spiral Matrix II 3 2 array   Rotate List 3 2 linked L IST two pointers Reverse linked list II 3 2 linked list two pointers 5 longest palindromic Substring 4 2 string   Reverse Nodes in K-group 4 2 linked list recursion two pointers Notoginseng Sudoku Solver 4 2 Array DFS combination Sum II 4 2 array combination trapping Rain Water 4 2 Array two pointers, stack Jump Game II 4 2 array   permutations II 4 2 array permutation Rotate Image 4 2 array   Spiral Matrix 4 2 array   Text Justification 4 2 str ing   sort Colors 4 2 array sort, two pointers Minimum Window Substring 4 2 string two pointers M-Gray Code 4 2   combination subsets II 4 2 array recursion combination Recover Binary Search Tree 4 2 tree Dfs distinc T subsequences 4 2 string DP 117 populating Next right pointers in all Node II 4 2 tree DFS 124 Binary tree Maximum Path Sum 4 2 Tree Dfs Next Permutation 5 2 array permutation Missing Positive 5 2 Array sort largest Rectangle in histogram 5 2 array St ACK Scramble String 5 2 string recursion, DP interleaving String 5 2 string recursion, DP Length of last Word 1 1 String   Same 1 1 tree dfs Maximum Depth of Binary tree 1 1 dfs Minimum Depth-Binary Tree 1 1 Tree DFS 126 Word Ladder II 1 1     longest Common Prefix 2 1 string   118 Pascal ' s triangle 2 1 Arra Y   119 Pascal ' s triangle II 2 1 array   121 Best Buy and Sell 2 1 array DP 6 zigzag conversion 3 1 string   3Sum closest 3 1 array two pointers Substring with concatenation to all Words 3 1 string two pointer S simplify Path 3 1 string stack Unique Binary Search Trees 3 1 tree DP Binary tree level ORDER traversal II 3 1 Tree BFS Triangle 3 1 array DP 122 best time to buy and Sell-II 3 1 array greedy longest Valid parentheses 4 1 string DP Unique BInary Search Trees II 4 1 tree dp, DFS 123 best in Buy and Sell stock III 4 1 array dp permutation Sequence 5 1 &N Bsp Permutation, Math maximal Rectangle 5 1 array dp, stack

It is a pity that the second master no longer updated, Jc2013 added a little new questions

1. Clone graph-> Bfs+hashmap
2. Gas STATION->DP
3. Candy->two Pointers
4. Single number-> Xor, HashMap, or Sum or Product way to find
5. Single number II-> Xor, HashMap
6. Copy List with Random pointers-> two pointers, HashMap and two times
Traverse (like clone graph)
7. List Cycle, list Cycle II, Reorder list-> two pointers
8. Binary Tree Preorder, postorder recursive-> Using stack to mock
Recursive way, or implement like Morris Way.
9. LRU cache-> HashMap + list
Insertion Sort list-> two pointers
One. Sort list-> I Implement merge Sort, still, two pointers method,
Combination of the merge sort list and split
List
Word Break-> DFS DP
Word break II-> DP + backtracking

Careercup 150 Summary of the two

Many people say that the 150 questions have been done again or several times, but I feel that the algorithm is the focus of the problem, the other many problems  
Try the basic can't touch, did not see it necessary to do all. Here's a summary of what you think is important. &NBSP

Chapter I: &NBSP
All important (1.6, 1.7 leetcode). &NBSP
1.5 face a encounters (string compression)  
1.7 face Z Encounters (set 0)  
1.8 face Bigfish Encounters (string rotation)  
Chapter II (2.4, 2.5 leetcode):  
all important. &NBSP
2.2 face Bigfish (find kth)  

Chapter Three:  
The Feeling is 3.2 (min stack), 3.5 (two stack queue) is important. The two faces m was asked. 3.6&NBSP
(sort stack) is also likely to be tested. &NBSP

Chapter Fourth (4.1, 4.3, 4.5 leetcode):  
sense 4.2, 4.3, 4.5, 4.6, 4.7 important. 4.5 (valid BST) face E,q encountered  

Fifth: 5.4 (N & (n-1))  

Sixth chapter: 6.5 (drop egg)  

Seventh chapter: 7.3 (Li NE intersection), 7.6 (line passes most points)  

Chapter Eighth: 8.4 (parking lot), 8.10 (Hashtabl