diff --git a/data_structures/Stacks/Stock-Span-Problem.py b/data_structures/Stacks/Stock-Span-Problem.py
index f64c712bb..9628864ed 100644
--- a/data_structures/Stacks/Stock-Span-Problem.py
+++ b/data_structures/Stacks/Stock-Span-Problem.py
@@ -1,8 +1,8 @@
 '''
 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.
+price quotes for a stock and we need to calculate span of stock's price for all n days.
 
-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 
 number of consecutive days just before the given day, for which the price of the stock 
 on the current day is less than or equal to its price on the given day.
 '''
@@ -49,4 +49,4 @@ S = [0 for i in range(len(price)+1)]
 calculateSpan(price, S) 
   
 # Print the calculated span values 
-printArray(S, len(price)) 
\ No newline at end of file
+printArray(S, len(price))