awesome-java-leetcode
我如今是一名Android Developer，大學(xué)的我曾是一名ACMer纤壁，我一直認(rèn)為數(shù)據(jù)結(jié)構(gòu)和算法是作為一名程序員必須掌握和善于利用的陵究，為了不讓數(shù)據(jù)結(jié)構(gòu)和算法淡出我的記憶攻走，所以我打算重拾LeetCode之Algorithm喉脖，語言選擇的是Java亚隙，題庫會一點(diǎn)點(diǎn)完善起來箫攀，按簡單肠牲，中等，困難分類靴跛，相應(yīng)難度下按題號排序缀雳，源代碼在src目錄中，相關(guān)解題都在note目錄中梢睛，想要學(xué)習(xí)數(shù)據(jù)結(jié)構(gòu)和算法或打算刷LeetCode的小伙伴們歡迎star哦肥印。
如今有機(jī)會面試Facebook，附上LeetCode上Facebook的面試題目序號绝葡，希望可以幫助到以后想入Facebook的小伙伴:-)
1,10,13,15,17,20,23,25,26,28,33,38,43,44,49,50,56,57,67,68,69,71,75,76
78,79,80,85,88,90,91,98,102,117,121,125,127,128,133,139,146,157,158,161
168,173,200,206,208,209,210,211,215,218,221,234,235,236,238,252,253,257
261,265,269,273,274,275,277,278,282,283,285,286,297,301,311,314,325,334
341,377,380,398,404,410,461,477,494,523,525,534,535,543,554
如果想知道更多公司LeetCode面試題深碱，可以參看Companies.md。
附上鎮(zhèn)樓詩：
明有科舉八股藏畅，今有LeetCode敷硅。
八股定格式而取文采心意，LeetCode定題目且重答案背誦。
美其名曰："practice makes perfect."
為何今不如古竞膳？
非也非也航瞭，
科舉為國取士，LeetCode為Google篩碼工坦辟，各取所需也刊侯。
Easy
| # | Title | Tag |
|---|---|---|
| 1 | Two Sum | Array, Hash Table |
| 7 | Reverse Integer | Math |
| 9 | Palindrome Number | Math |
| 13 | Roman to Integer | Math, String |
| 14 | Longest Common Prefix | String |
| 20 | Valid Parentheses | Stack, String |
| 21 | Merge Two Sorted Lists | Linked List |
| 26 | Remove Duplicates from Sorted Array | Array, Two Pointers |
| 27 | Remove Element | Array, Two Pointers |
| 28 | Implement strStr() | Two Pointers, String |
| 35 | Search Insert Position | String |
| 38 | Count and Say | String |
| 53 | Maximum Subarray | Array, Dynamic Programming, Divide and Conquer |
| 58 | Length of Last Word | String |
| 66 | Plus One | Array, Math |
| 67 | Add Binary | Math, String |
| 69 | Sqrt(x) | Binary Search, Math |
| 70 | Climbing Stairs | Dynamic Programming |
| 83 | Remove Duplicates from Sorted List | Linked List |
| 88 | Merge Sorted Array | Array, Two Pointers |
| 100 | Same Tree | Tree, Depth-first Search |
| 101 | Symmetric Tree | Tree, Depth-first Search, Breadth-first Search |
| 104 | Maximum Depth of Binary Tree | Tree, Depth-first Search |
| 107 | Binary Tree Level Order Traversal II | Tree, Breadth-first Search |
| 108 | Convert Sorted Array to Binary Search Tree | Tree, Depth-first Search |
| 110 | Balanced Binary Tree | Tree, Depth-first Search |
| 111 | Minimum Depth of Binary Tree | Tree, Depth-first Search, Breadth-first Search |
| 112 | Path Sum | Tree, Depth-first Search |
| 118 | Pascal's Triangle | Array |
| 119 | Pascal's Triangle II | Array |
| 121 | Best Time to Buy and Sell Stock | Array, Dynamic Programmin |
| 122 | Best Time to Buy and Sell Stock II | Array, Greedy |
| 543 | Diameter of Binary Tree | Tree |
Medium
| # | Title | Tag |
|---|---|---|
| 2 | Add Two Numbers | Linked List, Math |
| 3 | Longest Substring Without Repeating Characters | Hash Table, Two Pointers, String |
| 5 | Longest Palindromic Substring | String |
| 8 | String to Integer (atoi) | Math, String |
| 15 | 3Sum | Array, Two Pointers |
| 17 | Letter Combinations of a Phone Number | String, Backtracking |
| 19 | Remove Nth Node From End of List | Linked List, Two Pointers |
| 33 | Search in Rotated Sorted Array | Arrays, Binary Search |
| 43 | Multiply Strings | Math, String |
| 49 | Group Anagrams | Hash Table, String |
| 50 | Pow(x, n) | Math, Binary Search |
| 56 | Merge Intervals | Array, Sort |
| 554 | Brick Wall | Hash Table |
Hard
| # | Title | Tag |
|---|---|---|
| 4 | Median of Two Sorted Arrays | Array, Binary Search, Divide and Conquer |
| 10 | Regular Expression Matching | String, Dynamic Programming, Backtracking |
| 23 | Merge k Sorted Lists | Linked List, Divide and Conquer, Heap |
| 25 | Reverse Nodes in k-Group | Linked List |
| 44 | Reverse Nodes in k-Group | String, Dynamic Programming, Backtracking, Greedy |
| 57 | Insert Interval | Array, Sort |
| 68 | Text Justification | String |
