BQ: introduce yourself, what's your favourite project, and the challenging part?
Which team would you like to work with?
What are the technologies you are most interested in?
Why Facebook?
Past project and what's the funest thing in it.
- Two Sum
http://www.jianshu.com/p/1551aa62b1de - Longest Palindromic Substring
http://www.jianshu.com/p/04eff97a73f3 - Roman to Integer
http://www.jianshu.com/p/c2cbdd4d4cd1 - 3Sum(two methods)
http://www.jianshu.com/p/77fa1fedb155 - Valid Parentheses(follow up)
http://www.jianshu.com/p/c02e7d7bddc7 - Merge Two Sorted Lists
http://www.jianshu.com/p/b6e94b997b69 - Merge k Sorted Lists(follow up)
http://www.jianshu.com/p/0b47f75988e1 - Remove Duplicates from Sorted Array
http://www.jianshu.com/p/4c937c89da3c - Implement strStr()
http://www.jianshu.com/p/78140c0052c4 - Divide Two Integers
http://www.jianshu.com/p/9850bc7ba945 - Search in Rotated Sorted Array
http://www.jianshu.com/p/3173bc199558 - Count and Say
http://www.jianshu.com/p/dcad3feeb386 - Combination Sum
http://www.jianshu.com/p/2024717ef2a0 - Group Anagrams
http://www.jianshu.com/p/bc195c74bc07 - Valid Number
http://www.jianshu.com/p/7786966a00dc - Plus One
http://www.jianshu.com/p/6a274c447456 - Add Binary(follow up)
http://www.jianshu.com/p/e9146dc9334a - Climbing Stairs（follow up）
http://www.jianshu.com/p/1e4471e7c906 - Simplify Path
http://www.jianshu.com/p/292039fe5596 - Sort Colors
http://www.jianshu.com/p/4461825d8547 - Subsets
http://www.jianshu.com/p/2165b56150ac - Remove Duplicates from Sorted Array II
http://www.jianshu.com/p/ba725667fba8 - Search in Rotated Sorted Array II
http://www.jianshu.com/p/2569e0dca847 - Merge Sorted Array
http://www.jianshu.com/p/abfe88e51ada - Subsets II
http://www.jianshu.com/p/d1835d2bbc98 - Decode Ways
http://www.jianshu.com/p/7023e04194d4 - Validate Binary Search Tree
http://www.jianshu.com/p/a07546ee7b84 - Binary Tree Level Order Traversal(follow up)
http://www.jianshu.com/p/fae39d750c9f - Minimum Depth of Binary Tree
http://www.jianshu.com/p/28f7cabc825b - Best Time to Buy and Sell Stock
http://www.jianshu.com/p/a20f1a806537 - Best Time to Buy and Sell Stock II
http://www.jianshu.com/p/c4d3ffb2f309 - Valid Palindrome
http://www.jianshu.com/p/b63492c140f8 - Word Break(follow up)
http://www.jianshu.com/p/abb7fd9ae2ad - Binary Tree Preorder Traversal
http://www.jianshu.com/p/21a64874e0d1 - Number of Islands
http://www.jianshu.com/p/32d8e3307c9e - Reverse Linked List
http://www.jianshu.com/p/35800bf76d0a - Minimum Size Subarray Sum
http://www.jianshu.com/p/e2a50001c1fd - Course Schedule II
http://www.jianshu.com/p/a14ab82cc5c9 - Kth Smallest Element in a BST
http://www.jianshu.com/p/9fbf964d2509 - Meeting Rooms
http://www.jianshu.com/p/eabd13240a0d - Meeting Rooms II (follow up)
http://www.jianshu.com/p/412c1879d1b1 - Paint House
http://www.jianshu.com/p/3e96c5854a5c - Binary Tree Paths
http://www.jianshu.com/p/23b36abbfe09 - First Bad Version(First good version)
http://www.jianshu.com/p/5a9ee903c65f - Move Zeroes
http://www.jianshu.com/p/ccf0e16e395f - Inorder Successor in BST
http://www.jianshu.com/p/66c94c0d197e - Find Median from Data Stream
http://www.jianshu.com/p/43215858de12 - Serialize and Deserialize Binary Tree
http://www.jianshu.com/p/a65bbc6e9d53 - Sparse Matrix Multiplication
http://www.jianshu.com/p/aeef7ae1fb5e - Increasing Triplet Subsequence
http://www.jianshu.com/p/6acb260e0389 - Reverse String
http://www.jianshu.com/p/5fae3bdd37a7 - Intersection of Two Arrays
http://www.jianshu.com/p/2ef40cf45397 - Intersection of Two Arrays II （两种解法都需要会）
http://www.jianshu.com/p/fa8796d60e7b - Random Pick Index
http://www.jianshu.com/p/e178072d55a9
