|
4 | 4 |
|
5 | 5 | ||||| |
6 | 6 | | ---------------------:|:---:| :-----:| :---| |
7 | | -| 1 sequence : boolean(*)| 139|[Word Break](https://github.com/interviewcoder/leetcode/tree/master/src/_139_WordBreak)|| |
| 7 | +| 1 sequence : boolean(*)| 139|[Word Break](https://github.com/interviewcoder/leetcode/tree/master/src/_139_WordBreak)|O(2^n) -> O(N^2)| |
8 | 8 | | 1 sequence :`max`/min(*)| 198| House Robber|| |
9 | 9 | | 1 sequence :`max`/min(*)| 213|[House Robber II](https://github.com/interviewcoder/leetcode/tree/master/src/_213_HouseRobberII)|| |
10 | | -| 1 sequence :`max`/min(*)| 053|[Maximum Subarray](https://github.com/interviewcoder/leetcode/tree/master/src/_053_MaximumSubarray)|| |
11 | | -| 1 sequence :`max`/min(*)| 152|[Maximum Product Subarray](https://github.com/interviewcoder/leetcode/blob/master/src/_152_MaximumProductSubarray/Solution.java)| global V.S. local| |
| 10 | +| 1 sequence :`max`/min(*)| 053|[Maximum Subarray](https://github.com/interviewcoder/leetcode/tree/master/src/_053_MaximumSubarray)|global V.S. local, O(N^3) -> O(N)| |
| 11 | +| 1 sequence :`max`/min(*)| 152|[Maximum Product Subarray](https://github.com/interviewcoder/leetcode/blob/master/src/_152_MaximumProductSubarray/Solution.java)| global V.S. local, O(N^3) -> O(N)| |
12 | 12 | | 1 sequence : max/`min`(*)| 132|[Palindrome Partitioning II](https://github.com/interviewcoder/leetcode/tree/master/src/_132_PalindromePartitioningII)|| |
13 | 13 | | 1 sequence :`max`/min(*)| 032|[Longest Valid Parentheses](https://github.com/interviewcoder/leetcode/tree/master/src/_032_LongestValidParentheses)| global V.S. local| |
14 | | -| 1 sequence :`max`/min(*)| 121| Best Time to Buy and Sell Stock|| |
| 14 | +| 1 sequence :`max`/min(*)| 121| Best Time to Buy and Sell Stock|O(N^2) -> O(N)| |
15 | 15 | | 1 sequence :`max`/min(*)| 123| Best Time to Buy and Sell Stock III|| |
16 | | -| 1 sequence : count(*)| 091|[Decode Ways](https://github.com/interviewcoder/leetcode/tree/master/src/_091_DecodeWays)|| |
| 16 | +| 1 sequence : count(*)| 091|[Decode Ways](https://github.com/interviewcoder/leetcode/tree/master/src/_091_DecodeWays)|O(N^2) -> O(N)| |
17 | 17 | | 1 sequence : all(*)| 140| Word Break II: dp + backtracking|| |
18 | 18 |
|
19 | 19 |
|
|