# 901. Online Stock Span

### Description

Write a class `StockSpanner` which collects daily price quotes for some stock, and returns the *span* of that stock's price for the current day.

The span of the stock's price today is defined as the maximum number of consecutive days (starting from today and going backwards) for which the price of the stock was less than or equal to today's price.

For example, if the price of a stock over the next 7 days were `[100, 80, 60, 70, 60, 75, 85]`, then the stock spans would be `[1, 1, 1, 2, 1, 4, 6]`.

### Constraints

1. Calls to `StockSpanner.next(int price)` will have `1 <= price <= 10^5`.
2. There will be at most `10000` calls to `StockSpanner.next` per test case.
3. There will be at most `150000` calls to `StockSpanner.next` across all test cases.
4. The total time limit for this problem has been reduced by 75% for C++, and 50% for all other languages.

### Approach

### Links

* GeeksforGeeks
* [Leetcode](https://leetcode.com/problems/online-stock-span/)
* ProgramCreek
* [YouTube](https://youtu.be/lGWLBgwd-cw)

### **Examples**

{% tabs %}
{% tab title="Example 1" %}
**Input:**

\["StockSpanner","next","next","next","next","next","next","next"]

\[\[],\[100],\[80],\[60],\[70],\[60],\[75],\[85]]

**Output:** \[null,1,1,1,2,1,4,6]

**Explanation:**

First, S = StockSpanner() is initialized. Then:

S.next(100) is called and returns 1,

S.next(80) is called and returns 1,

S.next(60) is called and returns 1,

S.next(70) is called and returns 2,

S.next(60) is called and returns 1,

S.next(75) is called and returns 4,

S.next(85) is called and returns 6.

Note that (for example) S.next(75) returned 4, because the last 4 prices (including today's price of 75) were less than or equal to today's price.
{% endtab %}

{% tab title="Example 2" %}
**Input:**

\["StockSpanner", "next", "next", "next", "next", "next"]

\[\[], \[1], \[3], \[2], \[5], \[7]]

**Output:**

\[null, 1, 2, 1, 4, 5]

**Explanation:**

First, S = StockSpanner() is initialized. Then:

s.next(1) is called and returns 1,

s.next(3) is called and returns 2,

s.next(2) is called and returns 1,

s.next(5) is called and returns 4,

s.next(7) is called and returns 5
{% endtab %}
{% endtabs %}

### **Solutions**

{% tabs %}
{% tab title="Solution 1" %}

```java
/**
 * Time complexity : O(N)
 * Space complexity : O(N)
 */

class StockSpanner {    
    private LinkedList<int[]> stack;
    
    public StockSpanner() {
        stack = new LinkedList();
    }
    
    public int next(int price) {
        int count = 0;
        while(!stack.isEmpty() && stack.peek()[0] <= price) {
            count += stack.pop()[1];
        }
        count++;
        stack.push(new int[]{price, count});
        return count;
    }
}

/**
 * Your StockSpanner object will be instantiated and called as such:
 * StockSpanner obj = new StockSpanner();
 * int param_1 = obj.next(price);
 */
```

{% endtab %}
{% endtabs %}

### **Follow up**

*


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://code-snippets.hbamithkumara.com/leetcode/problems/901-1000/online-stock-span.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.