I am an Android Developer now, and I used to be an ACMer in university. I always believe that data structure and Algorithm must be mastered and well used as a programmer. In order not to let the data structure and Algorithm fade from my memory, I plan to pick up the Algorithm of LeetCode again. The language is Java, the questions bank will be improved bit by bit, classified by easy, medium and difficult, and sorted by question number for corresponding difficulty. The source code is in the SRC directory, and the relevant solutions are in the Note directory. Welcome to star if you want to learn data structures and algorithms or plan to scan LeetCode.
Now I have the opportunity to have an interview with Facebook. Attached is the number of the interview questions on Facebook in LeetCode. I hope it can help those who want to join Facebook in the future 🙂
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 168173200206208209210211215218221234235236238252253257 261265269273274275277278282283285286297301311314325334 341377380398404410461477494523525534535543554
Copy the code
For more LeetCode interview questions, see Companies. Md.
Attached is the poem of the town:
Ming has eight imperial examinations, today has LeetCode. Eight sets the format and take literary heart, LeetCode sets the topic and recites the answer. It’s called: “Practice makes perfect.” Neither nor neither, imperial examinations for the country to take scholars, LeetCode for Google screening code workers, each also need.
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 |