class Solution:
def digit_sum(self, num) -> int:
s = 0
for d in str(num):
s += int(d)
return s
def maximumSum(self, nums) -> int:
h = -1
nums = sorted(nums, reverse=True)
for i in range(len(nums)):
for j in range(i+1, len(nums)):
i_n = nums[i]
j_n = nums[j]
if i_n + j_n < h:
break
i_s = self.digit_sum(nums[i])
j_s = self.digit_sum(nums[j])
if i_s != j_s:
continue
s = i_n + j_n
if s > h:
h = s
return h