Fetching algorithms...

Online Stock Span Visualizer & Solution | Rulcode

Loading problem details...

229. Online Stock Span

Medium

Topics

Companies

Hint

Understand Before Coding

Visualize This Problem

Open Visualizer

Draw Your Approach

Draw

Example 1:

Input:

commands = ["StockSpanner", "next", "next", "next", "next", "next", "next", "next"], prices = [[], [100], [80], [60], [70], [60], [75], [85]]

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

Explanation:

StockSpanner stockSpanner = new StockSpanner(); Initializes the system.
stockSpanner.next(100); Stack: [[100, 1]]. Returns 1.
stockSpanner.next(80); Stack: [[100, 1], [80, 1]]. Returns 1.
stockSpanner.next(60); Stack: [[100, 1], [80, 1], [60, 1]]. Returns 1.
stockSpanner.next(70); Pop [60,1] (70 >= 60), span becomes 1+1=2. Stack: [[100, 1], [80, 1]]. Push [70,2]. Stack: [[100, 1], [80, 1], [70, 2]]. Returns 2.
stockSpanner.next(60); Stack: [[100, 1], [80, 1], [70, 2], [60, 1]]. Returns 1.
stockSpanner.next(75); Pop [60,1] (75>=60), span becomes 1+1=2. Pop [70,2] (75>=70), span becomes 2+2=4. Stack: [[100, 1], [80, 1]]. Push [75,4]. Stack: [[100, 1], [80, 1], [75, 4]]. Returns 4.
stockSpanner.next(85); Pop [75,4] (85>=75), span becomes 1+4=5. Pop [80,1] (85>=80), span becomes 5+1=6. Stack: [[100, 1]]. Push [85,6]. Stack: [[100, 1], [85, 6]]. Returns 6.

Constraints:

•
•

Time Complexity

N/A

Space Complexity

N/A