Available question text
Given an array of daily stock prices and trading constraints (e.g., limits on number of transactions, transaction fees, or cooldowns), compute the maximum profit achievable by choosing buy/sell days. This typically requires modeling holding vs. not-holding states and using dynamic programming or a state-machine/greedy approach to track optimal decisions over time.
Related questions
Continue with questions that share topics or the same question type.
- Maximum Profit from Trading Stocks with Discounts
Coding
- Maximum Profit from Valid Topological Order in DAG
Coding
- Find Maximum Removals From Source String
Coding
- Given an array nums and a sliding window of size k moving from the very left to the very right, return the maximum value in the window for each position. Solve in O(n) time using a deque.
Coding
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
Meta
Leetcode 2291. Maximum Profit From Trading Stocks
Reported Nov 4, 2025 · 1 source report
MANAGER
Source snapshot: Nov 12, 2026
View source