tag

#stock

3 pages tagged

Practice › LeetCode › LeetCode (archived) › LeetCode 07xx ›

LeetCode 714: Best Time to Buy and Sell Stock with Transaction Fee

Problem Restatement We are given an array prices . prices[i] is the price of a stock on day i . We are also given an integer fee . We may complete as many transactions as we want, but we cannot hold more than one share at the same time. That means we must sell the current stock before buying again. Each completed transaction pays the transaction fee once. Return the...
leetcode array dynamic-programming greedy stock May 12, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 01xx ›

LeetCode 188: Best Time to Buy and Sell Stock IV

Problem Restatement We are given an integer k and an array prices . prices[i] is the stock price on day i . We need to find the maximum profit possible with at most k transactions. One transaction means buying once and selling once. We cannot hold more than one stock at the same time, so we must sell before buying again. The official statement asks for the maximum profit with...
leetcode array dynamic-programming stock May 10, 2026
Practice › LeetCode › LeetCode (archived) › LeetCode 03xx ›

LeetCode 309: Best Time to Buy and Sell Stock with Cooldown

Problem Restatement We are given an integer array prices . prices[i] is the price of a stock on day i . We may complete as many transactions as we want, but with two restrictions: We cannot hold more than one stock at the same time. After selling a stock, we cannot buy on the next day. That next day is a cooldown day. Return the maximum profit we can make....
leetcode array dynamic-programming stock May 10, 2026