diff --git a/algoexpert.io/python/Maximum_Subset_Sum_With_No_Adjacent_Element.py b/algoexpert.io/python/Maximum_Subset_Sum_With_No_Adjacent_Element.py
index 6ef4e30..21e4236 100644
--- a/algoexpert.io/python/Maximum_Subset_Sum_With_No_Adjacent_Element.py
+++ b/algoexpert.io/python/Maximum_Subset_Sum_With_No_Adjacent_Element.py
@@ -9,7 +9,7 @@ def max_subset_sum_with_no_adjacent(array):
     max_sum = array[:]      # copying the array into max_sum
     max_sum[1] = max(array[0], array[1])
     for i in range(2, len(array)):
-        max_sum[i] = max_sum(max_sum[i - 1], max_sum[i - 2] + array[i])
+        max_sum[i] = max(max_sum[i - 1], max_sum[i - 2] + array[i])
     return max_sum[-1]      # -1 refers to the last index
 
 # Solution 2