added coverage

Author: S-M-J-I

data_structures/stacks/min_ele_const_time.py

@@ -1,5 +1,5 @@
 """
-Given an set of numbers in a stack, 
+Given an set of numbers in a stack,
 find the minimum value from the stack at O(1)
 
 Problem: https://leetcode.com/problems/min-stack/description/
@@ -30,7 +30,7 @@ def push(value: int) -> None:
 
 def pop() -> None:
     """
-    Pop from the stack. 
+    Pop from the stack.
     If the popped value is the same as the min stack top,
     pop from the min stack as well
 
@@ -49,7 +49,7 @@ def pop() -> None:
 
 def get_min() -> int:
     """
-    Return the minimum element of the main stack by 
+    Return the minimum element of the main stack by
     returning the top of the minimum stack
 
     Returns the minimum element (int)