Skip to content

Commit 99bff34

Browse files
committed
🐮 Update Companies
1 parent 311f377 commit 99bff34

File tree

2 files changed

+5
-32
lines changed

2 files changed

+5
-32
lines changed

Companies.md

Lines changed: 1 addition & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -60,6 +60,7 @@
6060
1,3,14,49,56,126,127,151,206,207,218,242,347,380,381,564
6161
```
6262

63+
6364
### Apple
6465
```
6566
1,4,7,21,28,36,42,48,69,70,102,104,118,149,151,165,190,191,206,207,215

README-List.md

Lines changed: 4 additions & 32 deletions
Original file line numberDiff line numberDiff line change
@@ -14,38 +14,8 @@ LeetCode of algorithms with golang solution(updating).
1414
| 1 | [Two Sum][0001] | Array, Hash Table |
1515
| 7 | [Reverse Integer][0007] | Math |
1616
| 9 | [Palindrome Number][0009] | Math |
17-
| 13 | [Roman to Integer][013] | Math, String |
18-
| 14 | [Longest Common Prefix][014] | String |
19-
| 20 | [Valid Parentheses][020] | Stack, String |
20-
| 21 | [Merge Two Sorted Lists][021] | Linked List |
21-
| 26 | [Remove Duplicates from Sorted Array][026] | Array, Two Pointers |
22-
| 27 | [Remove Element][027] | Array, Two Pointers |
23-
| 28 | [Implement strStr()][028] | Two Pointers, String |
24-
| 35 | [Search Insert Position][035] | String |
25-
| 38 | [Count and Say][038] | String |
26-
| 53 | [Maximum Subarray][053] | Array, Divide and Conquer, Dynamic Programming |
27-
| 58 | [Length of Last Word][058] | String |
28-
| 66 | [Plus One][066] | Array, Math |
29-
| 67 | [Add Binary][067] | Math, String |
30-
| 69 | [Sqrt(x)][069] | Binary Search, Math |
31-
| 70 | [Climbing Stairs][070] | Dynamic Programming |
32-
| 83 | [Remove Duplicates from Sorted List][083] | Linked List |
33-
| 88 | [Merge Sorted Array][088] | Array, Two Pointers |
34-
| 100 | [Same Tree][100] | Tree, Depth-first Search |
35-
| 101 | [Symmetric Tree][101] | Tree, Depth-first Search, Breadth-first Search |
36-
| 104 | [Maximum Depth of Binary Tree][104] | Tree, Depth-first Search |
37-
| 107 | [Binary Tree Level Order Traversal II][107] | Tree, Breadth-first Search |
38-
| 108 | [Convert Sorted Array to Binary Search Tree][108] | Tree, Depth-first Search |
39-
| 110 | [Balanced Binary Tree][110] | Tree, Depth-first Search |
40-
| 111 | [Minimum Depth of Binary Tree][111] | Tree, Depth-first Search, Breadth-first Search |
41-
| 112 | [Path Sum][112] | Tree, Depth-first Search |
42-
| 118 | [Pascal's Triangle][118] | Array |
43-
| 119 | [Pascal's Triangle II][119] | Array |
44-
| 121 | [Best Time to Buy and Sell Stock][121] | Array, Dynamic Programmin |
45-
| 122 | [Best Time to Buy and Sell Stock II][122] | Array, Greedy |
46-
| 543 | [Diameter of Binary Tree][543] | Tree |
47-
48-
17+
| 13 | [Roman to Integer][0013] | Math, String |
18+
| 14 | [Longest Common Prefix][0014] | String |
4919

5020

5121

@@ -56,4 +26,6 @@ LeetCode of algorithms with golang solution(updating).
5626
[0001]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0001.Two-Sum
5727
[0007]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0007.Reverse-Integer
5828
[0009]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0009.Palindrome-Number
29+
[0013]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0013.Roman-to-Integer
30+
[0014]: https://github.com/kylesliu/awesome-golang-leetcode/tree/master/src/0014.Longest-Common-Prefix
5931

0 commit comments

Comments
 (0)