One test case falling

#1
#2

Aryan, I would recommend you to plz go through the online video lecture given in the stack section on Stock span problem …

#3

@yuktimutreja01 this question is a little different and i cant figure out for what test case is it failing

#4

Aryan, plz verify if the question is this or not,

The stock span problem is a financial problem where we have a series of N daily price quotes for a stock and we need to calculate span of stock’s price for all N days. You are given an array of length N, where ith element of array denotes the price of a stock on ith. Find the span of stock’s price on ith day, for every 1<=i<=N.
A span of a stock’s price on a given day, i, is the maximum number of consecutive days before the (i+1)th day, for which stock’s price on these days is less than or equal to that on the ith day.

Input Format:
Enter the size of the array N and add N more numbers and store in the array.

Constraints:
None

Output Format
Display the array containing stock span values.

Sample Input
5
30
35
40
38
35
Sample Output
1 2 3 1 1 END

#5

ohhh you replied so fast… i already did it -_-