diff --git a/02. simpleArraySum/solution.py b/02. simpleArraySum/solution.py
index 2691e06..f30b348 100644
--- a/02. simpleArraySum/solution.py	
+++ b/02. simpleArraySum/solution.py	
@@ -7,10 +7,6 @@
 '''
 #!/bin/python3
 
-import os
-import sys
-
-#
 # Complete the simpleArraySum function below.
 #
 def simpleArraySum(ar:list):
diff --git a/07. Staircase/solution.py b/07. Staircase/solution.py
index d76f332..0351414 100644
--- a/07. Staircase/solution.py	
+++ b/07. Staircase/solution.py	
@@ -5,13 +5,6 @@
     Problem Statement : Write a program that prints a staircase of size 'n'.
     Url : https://www.hackerrank.com/challenges/staircase/problem
 '''
-#!/bin/python3
-
-import math
-import os
-import random
-import re
-import sys
 
 # Complete the staircase function below.
 def staircase(n):
diff --git a/08. Mini-MaxSum/solution.py b/08. Mini-MaxSum/solution.py
index 3fd0179..6599433 100644
--- a/08. Mini-MaxSum/solution.py	
+++ b/08. Mini-MaxSum/solution.py	
@@ -11,18 +11,13 @@
 '''
 #!/bin/python3
 
-import math
-import os
-import random
-import re
-import sys
-
 # Complete the miniMaxSum function below.
 def miniMaxSum(arr):
+    """ find the minimum and maximum values that can be calculated by summing exactly four of the five integers """
     arr = sorted(arr)
-    print(sum(arr[:-1]),sum(arr[1:]))
-    
-if __name__ == '__main__':
-    arr = list(map(int, input().rstrip().split()))
+    return sum(arr[:-1]), sum(arr[1:])
 
-    miniMaxSum(arr)
+assert miniMaxSum([1, 3, 5, 7, 9]) == (16, 24)
+assert miniMaxSum([1, 2, 3, 4, 5]) == (10, 14)
+assert miniMaxSum([5, 1, 1, 5]) == (7, 11)
+assert miniMaxSum([1, 1, 1, 1, 1]) == (4, 4)