Feature #8: Find Intervals

Description

We are given the price predictions, prices, of a stock over a future time window. We are interested in making a profit by selling the stock at a higher price.

There are n intervals in the time window, where each $i^{th}$ interval represents a stock’s predicted price for that interval. Our goal is to return an array, intervals, such that intervals[i] is the minimum number of intervals after the ith interval when the price will increase. If there is no time interval for which this is possible, we will keep intervals[i] == 0 instead.

The following examples may clarify these requirements:

Solution

We are given an array that represents the time series of the predicted stock prices over n future intervals, all of equal duration. The $i^{th}$ ...