Stock Maximize Discussions | Algorithms | HackerRank
We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Dynamic Programming
  4. Stock Maximize
  5. Discussions

Stock Maximize

  • dhirajdhule
     + 1 comment

    fast and simple. find the max price, split the array before and after max price, buy all stocks before max price and then sell them at max price; repeat above procedure on the array after max element. Thats it!

        def iter_over_p(p):
        ind_max = p.index(max(p))
        inv = sum(p[:ind_max])
        pf = len(p[:ind_max])*p[ind_max] - inv
        if len(p[ind_max+1:]) > 0:
            pf += iter_over_p(p[ind_max+1:])
        return pf
    profit = iter_over_p(prices)