Skip to content

Commit 0f4f668

Browse files
committed
update doc
1 parent 94e406b commit 0f4f668

File tree

4 files changed

+14
-3
lines changed

4 files changed

+14
-3
lines changed

README.md

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -211,7 +211,7 @@ P.S.:
211211
| 179 | [Largest Number](https://github.com/interviewcoder/leetcode/blob/master/src/_179_LargestNumber/Solution.java) | Medium | `Sort` | |
212212
| 186 | [Reverse words in a string II](https://github.com/interviewcoder/leetcode/blob/master/src/_186_ReverseWordsInAStringII/Solution.java) | Medium | `Array` | two pass + include last position trick |
213213
| 187 | Repeated DNA Sequences | Medium | `Hash Table` `Bit Manipulation` | |
214-
| 188 | Best Time to Buy and Sell Stock IV | Hard | `Dynamic Programming` | |
214+
| 188 | [Best Time to Buy and Sell Stock IV](https://github.com/interviewcoder/leetcode/blob/master/src/_188_BestTimeToBuyAndSellStockIV/Solution.java) | Hard | `Dynamic Programming` | |
215215
| 189 | [Rotate Array](https://github.com/interviewcoder/leetcode/blob/master/src/_189_RotateArray/Solution.java) | Easy | `Array` | |
216216
| 190 | Reverse Bits | Easy | `Bit Manipulation` | |
217217
| 191 | Number of 1 Bits | Easy | `Bit Manipulation` | |
@@ -281,8 +281,10 @@ P.S.:
281281
| 279 | Perfect Squares | Medium | `Dynamic Programming` `Breadth-first Search` `Math` | |
282282
| 282 | Expression Add Operators | Hard | `Divide and Conquer` | |
283283
| 283 | [Move Zeroes](https://github.com/interviewcoder/leetcode/blob/master/src/_283_MoveZeroes/Solution.java) | Easy | `Array` `Two Pointers` | |
284-
| 284 | Peeking Iterator | Medium | `Design` | |
284+
| 284 | [Peeking Iterator](https://github.com/interviewcoder/leetcode/blob/master/src/_284_PeekingIterator/Solution.java) | Medium | `Design` | |
285285
| 285 | [Inorder Successor in BST](https://github.com/interviewcoder/leetcode/tree/master/src/_285_InorderSuccessorInBST) | Medium | `Tree` | |
286286
| 286 | [Walls And Gates](https://github.com/interviewcoder/leetcode/tree/master/src/_286_WallsAndGates) | Medium | `BFS` | |
287287
| 287 | Find the Duplicate Number | Hard | `Array` `Two Pointers` `Binary Search` | |
288+
| 289 | Game of Life | Medium | `Array` | |
289+
| 290 | Word Pattern | Easy | `Hash Table` | |
288290

doc/README.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
#### Category
22

3-
1. [DFS/Backtracking](https://github.com/interviewcoder/leetcode/blob/master/doc/category_dfs.md)
3+
0. [DFS/Backtracking](https://github.com/interviewcoder/leetcode/blob/master/doc/category_dfs.md)
44
- Backtracking: `template` `skip duplicates` `prune siblings`
55

66
0. [Dynamic Programming](https://github.com/interviewcoder/leetcode/blob/master/doc/category_dp.md)

doc/category_basic.md

Lines changed: 7 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,7 @@
1+
#### Category : Basic
2+
3+
Basic operations, string manipulation,
4+
5+
| Type | # | Description |
6+
| ----- |:---:| ------ |
7+
| `String` `Include Last` | 151 | Reverse Words In A String |

doc/category_binarysearch.md

Lines changed: 2 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -2,4 +2,6 @@
22

33
| Type | # | Description |
44
| ---------------------: |:---:| :------------|
5+
| rotated array | 153 | [Find Minimum in Rotated Sorted Array](https://github.com/interviewcoder/blob/master/src/_153_FindMinimumInRotatedSortedArray/) |
6+
| rotated array | 154 | [Find Minimum in Rotated Sorted Array II]() |
57
| matrix | 240 | [Search A 2D Matrix II](https://github.com/interviewcoder/leetcode/blob/master/src/_240_SearchA2DMatrixII/Solution.java) |

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy