``` You are given an array prices where prices[i] is the price of a given stock on the ith day.
Find the maximum profit you can achieve. You may complete at most two transactions.
Note: You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).
Write Python code to solve this: def maxProfit(self, prices: List[int]) -> int: ```
Output:
``` It seems like you want to find the maximum profit that can be achieved by buying and selling stocks, with the constraint that you can only make at most two transactions. Is that correct?
Could you please provide some example input and output to help me better understand your requirements? ```
I also tried a more basic prompt, but the output is not what I'd consider good code.
Can you maybe share some examples where we can see how it exceeds GPT-4's capabilities? Thanks!
Only exception I found is with some of the Leetcode Premium questions, you might have to actually type in the problem statement, but it's still very likely that multiple solutions have been ingested from GitHub and elsewhere.
GPT-4 on the other hand provided a good answer for both questions. Also I guess the UI is buggy w.r.t code formatting, it things the following line is a code and switches to a code block.
``` You are given an array prices where prices[i] is the price of a given stock on the ith day. ```
The only downside for GPT-4 for me right now, is its slowness.