Steffy Losteffy.hashnode.dev·Jun 27, 2020Dynamic Programming Series #5: Maximize Stock ProfitsHere's today's problem. Say you have an array for which the ith element is the price of a given stock on day i. If you were only permitted to complete at most one transaction (i.e., buy one and sell one share of the stock), design an algorithm to fi...3 likes·71 readsComputer ScienceAdd a thoughtful commentNo comments yetBe the first to start the conversation.