search

douglas-cerrato / LeetCode-75

This will just be a folder of the Blind LeetCode 75 problem challenge located here: https://leetcode.com/discuss/general-discussion/460599/blind-75-leetcode-questions
1 stars 0 forks source link

bestTimeForStocks.py #7

Closed douglas-cerrato closed 7 months ago

douglas-cerrato commented 7 months ago

Best Time to Buy and Sell Stock

You are given an array prices where prices[i] is the price of a given stock on the i-th day.

You want to maximize your profit by choosing a single day to buy one stock and choosing a different day in the future to sell that stock.

Return the maximum profit you can achieve from this transaction. If you cannot achieve any profit, return 0.

Example 1:

Input: prices = [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.
Note that buying on day 2 and selling on day 1 is not allowed because you must buy before you sell.

Example 2:

Input: prices = [7,6,4,3,1]
Output: 0
Explanation: In this case, no transactions are done and the max profit = 0.
douglas-cerrato commented 7 months ago

Currently found a solution that works fine pushed in commit https://github.com/douglas-cerrato/LeetCode-75/commit/4cbdc5006d8099835b83dcfec6eaa61c03ba6736. However when running through the Leetcode test cases, it exceedes the time limit on some of the larger data sets. Going to work on optimization

douglas-cerrato commented 7 months ago

Finished optimizing the algorithm and now it has the top 4% runtime on the leetcode problem. All details explaining how I solved this are in this commit https://github.com/douglas-cerrato/LeetCode-75/commit/55163966aeb1f27696d3a50cacb34c0e4390b5b2. Closing and merging to main