1 parent 054b4b3 commit 63c7e8eCopy full SHA for 63c7e8e
1 file changed
data_structures/Stacks/Stock-Span-Problem.py
@@ -1,8 +1,8 @@
1
'''
2
The stock span problem is a financial problem where we have a series of n daily
3
-price quotes for a stock and we need to calculate span of stock’s price for all n days.
+price quotes for a stock and we need to calculate span of stock's price for all n days.
4
5
-The span Si of the stock’s price on a given day i is defined as the maximum
+The span Si of the stock's price on a given day i is defined as the maximum
6
number of consecutive days just before the given day, for which the price of the stock
7
on the current day is less than or equal to its price on the given day.
8
@@ -49,4 +49,4 @@ def printArray(arr, n):
49
calculateSpan(price, S)
50
51
# Print the calculated span values
52
-printArray(S, len(price))
+printArray(S, len(price))
0 commit comments