From a18cf30d335024c8382ba79990a32f282db6bee0 Mon Sep 17 00:00:00 2001
From: YOGESSH V <40272613+Yogessh3@users.noreply.github.com>
Date: Sat, 7 Nov 2020 14:31:21 +0530
Subject: [PATCH] Update Maximum_Subset_Sum_With_No_Adjacent_Element.py

---
 .../python/Maximum_Subset_Sum_With_No_Adjacent_Element.py       | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

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