Skip to content

Commit 8b09148

Browse files
committed
Dec18
1 parent 02f9078 commit 8b09148

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

README.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -78,7 +78,7 @@ Solutions <a href = "https://github.com/aliasvishnu/leetcode/tree/master/Solutio
7878
| 117 | BFS | Same hint as 116. | O(n) |
7979
| 118 | BF | Generate new row from old row. | O(n^2) |
8080
| 119 | BF | Generate new row from old row. | O(n^2) |
81-
| 128 | DP | DP problem, find recurrence relation. | |
81+
| 128 | DP | DP problem, find recurrence relation. | O(n) |
8282
| 413 | Array | [1, 2, 3, 4, 5, 7, 9, 11]. can be written as [5, 3] i.e. 5 sequence of difference 1 and 3 sequence of difference 2, you need to figure out how many parts you can split 5 and 3 into. | O(n) |
8383
| 694 | DFS | Keep track of the directions in which DFS proceeds in some form, maybe a string like ddr for down down right. | O(rows*cols) |
8484
| 738 | Array | Find the first time Xi > Xi+1, Xi -= 1 and turn all Xi+k = 9, For eg, 321 becomes 299. Figure out cases like 33332. | O(n) |

0 commit comments

Comments
 (0)