You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
|[Leetcode-3048. Earliest Second To Mark Indices I](https://leetcode.com/problems/earliest-second-to-mark-indices-i/description/)|[python](./leetcode/3048.earliest-second-to-mark-indices-i.py), [c++](./leetcode/3048.earliest-second-to-mark-indices-i.cpp)| O\(M\*logM\)| O\(M\)|\-| - |
196
196
197
197
## Dynamic Programming
198
-
| Problem(28) | Solution | Time | Space | Note | Ref |
198
+
| Problem(29) | Solution | Time | Space | Note | Ref |
|[Leetcode-309. Best Time To Buy And Sell Stock With Cooldown](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-with-cooldown/description/)|[c++](./leetcode/309.best-time-to-buy-and-sell-stock-with-cooldown.cpp), [python](./leetcode/309.best-time-to-buy-and-sell-stock-with-cooldown.py)| O\(N\)| O\(N\)|\-| - |
214
215
|[Leetcode-322. Coin Change](https://leetcode.com/problems/coin-change/description/)|[c++](./leetcode/322.coin-change.cpp), [python](./leetcode/322.coin-change.py)| O\(K \* N\)| O\(N\)| Index |[Video](https://youtu.be/EjMjlFjLRiM)|
215
216
|[Leetcode-375. Guess Number Higher Or Lower II](https://leetcode.com/problems/guess-number-higher-or-lower-ii/description/)|[c++](./leetcode/375.guess-number-higher-or-lower-ii.cpp), [python](./leetcode/375.guess-number-higher-or-lower-ii.py)| O\(N^3\)| O\(N^2\)| DP\(Index\)| - |
// You are given an array prices where prices[i] is the price of a given stock on the ith day.
8
+
// Find the maximum profit you can achieve. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times) with the following restrictions:
9
+
//
10
+
// After you sell your stock, you cannot buy stock on the next day (i.e., cooldown one day).
11
+
//
12
+
// Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).
# You are given an array prices where prices[i] is the price of a given stock on the ith day.
8
+
# Find the maximum profit you can achieve. You may complete as many transactions as you like (i.e., buy one and sell one share of the stock multiple times) with the following restrictions:
9
+
#
10
+
# After you sell your stock, you cannot buy stock on the next day (i.e., cooldown one day).
11
+
#
12
+
# Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).
0 commit comments