Ramesh Kumar devrkd
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| interface Observable { | |
| subscribe(observer: Observer): void; | |
| unsubscribe(observer: Observer): void; | |
| notify(): void; | |
| } | |
| interface Observer { | |
| update(subject: Subject); | |
| } |
devrkd
/ solution.ts
Created
June 17, 2021 16:49
How to maximize stock profits, dynamic programming question
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** | |
| * Problem Statement: | |
| * 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 find the maximum profit. | |
| * Note that you cannot sell a stock before you buy one. | |
| * Example 1: | |
| * Input: [7,1,5,3,6,4] | |
| * Output: 5 | |
| * Explanation: Buy on day 2 (price = 1) and sell on day 5 (price = 6). Profit = 6–1 = 5. Not 7–1 = 6, as selling price needs to be larger than buying price. | |
| * Example 2: |
OlderNewer