Hey I am Ananya ,converting the written text in the repo to English so that it could be read by people all ovr the world without barrier of language preventing them to do so.
I am now an Android Developer, and I used to be an ACMer in college. I always think that data structures and algorithms must be mastered and used well as a programmer. In order to prevent data structures and algorithms from fading out of my memory, so I plan to revisit LeetCode's Algorithm. The language of choice is Java. The question bank will be improved a little bit. It will be sorted by easy, medium, and difficult, and sorted by question number under the corresponding difficulty. The source code is in the src directory, and the related problems are all in the note In the catalog, those who want to learn data structures and algorithms or plan to use LeetCode welcome star.
Now I have the opportunity to interview Facebook, and attach the interview question number of Facebook on 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
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
If you want to know more company LeetCode interview questions, you can refer to Companies.md.
Attached to the town house poem:
There is a stereotype of imperial examination, and now there is LeetCode. Stereotypes set the format and take the literary heart, LeetCode sets the title and repeats the answer to recite. Beautifully named: "practice makes perfect." Why is today not as good as old? No, no, The imperial examination is a national candidate, LeetCode is a Google screener, and everyone takes what they need.
| # | 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 |
| 16.11 | 跳水板(Diving Board LCCI) | 递归、记忆化 |
| 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, Divide and Conquer, Dynamic Programming |
| 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][107] | 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 |
| # | 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 |
| 30 | Substring with Concatenation of All Words | Hash Table, Two Pointers, String |
| 44 | Wildcard Matching | String, Dynamic Programming, Backtracking, Greedy |
| 57 | Insert Interval | Array, Sort |
| 68 | Text Justification | String |
| 1028 | 从先序遍历还原二叉树(Recover a Tree From Preorder Traversal) | 树、深度优先搜索 |
Welcome to join my knowledge planet "基你太美", I will share [AucFrame](https://blankj.com/2019 /07/22/auc-frame/) Frame, Dachang Mianjing, AndroidUtilCode More detailed instructions... All the knowledge I know, you can go through Pay to enter my planet "基你太美" to experience it. After joining, you will give priority to watching the best parts of the planet. If you feel that the content of the planet is not for you Earnings, you can apply for a refund and leave the planet by yourself, and there is no need to add my friends; **If you have determined to stay on my planet, you can scan the following QR code (note: based on you are too beautiful + your planet nickname) Add my personal WeChat, so that I can pull you into the group later (PS: the earlier you enter, the cheaper the price). **
![My QR code]
