TheAlgorithms · deadshotsb · May 19, 2020 · May 19, 2020 · May 19, 2020
diff --git a/data_structures/linked_list/singly_linked_list.py b/data_structures/linked_list/singly_linked_list.py
@@ -106,7 +106,7 @@ def __setitem__(self, index, data):
                 raise IndexError("Index out of range.")
             current = current.next
         current.data = data
-       
+
     def __len__(self):
         """
         Return length of linked list i.e. number of nodes

diff --git a/maths/bailey_borwein_plouffe.py b/maths/bailey_borwein_plouffe.py
@@ -39,7 +39,7 @@ def bailey_borwein_plouffe(digit_position: int, precision: int = 1000) -> str:
     if (not isinstance(digit_position, int)) or (digit_position <= 0):
         raise ValueError("Digit position must be a positive integer")
     elif (not isinstance(precision, int)) or (precision < 0):
-        raise ValueError("Please input a nonnegative integer for the precision")
+        raise ValueError("Precision must be a nonnegative integer")
 
     # compute an approximation of (16 ** (n - 1)) * pi whose fractional part is mostly accurate
     sum_result = (