Leetcode problem solving...

5/29

611 valid triangle number -- three pointers -> binary search

1 two sum (hashmap --> need index)

5/31

15 3 sum (two pointers, hashset)

 

8/5

234 palindrome linedlist (2) (3)

206. Reverse Linked List (2) 

92 reverse linedlist 2 (2)

138 copy random list (2)(3 not very well, detach the list)

155 min stack 

716 max stack (2)

463 Island perimeter (array)-- follow up questions 2

108 convert array to BST 2

109 convert list to BST  2

105 build tree from preorder and inorder

106 build tree from inorder and postorder

200 number of islands (dfs)

693 max area of island (dfs + )

283 mvoe zeros (two pointer) 2 

133 clone graph (dfs, bfs) 2(dfs)

35 search insert poition (binary search: find the first >= element, in code ganker) 2

349 intersections of two arrays (set + bianry search) 1

162 find peak element (binary search) 1

278 First bad version 1

74 search 2D matrix 1

240 search 2D matrix 2 (1)

475 heaters (application fo binary searc: why we use binary search) (1)

50 Pow(x, n) (1)

268 Missing integer

41 first missing postive numbers

30 Substring with Concatenation of All Words 

 

11/2

leetcode 62 plus one, slove it efficient.

 

more solution (http://www.cnblogs.com/grandyang/p/5507129.html)

good reference for binary search (http://www.voidcn.com/article/p-mlwbzguh-bke.html)

to learn: priority queue(heapify, heap sort, from 716), tree treverse, binary search, two sum, sorting algorithm, memo recursion