From d7bb42f6453e3c42db38c7fade382aa7223a7a05 Mon Sep 17 00:00:00 2001
From: STREIN_11 <71601569+STREIN-11@users.noreply.github.com>
Date: Mon, 25 Sep 2023 14:33:42 +0530
Subject: [PATCH] Update Max_sum_combination.cpp

---
 Daily/Max_sum_combination.cpp | 1 -
 1 file changed, 1 deletion(-)

diff --git a/Daily/Max_sum_combination.cpp b/Daily/Max_sum_combination.cpp
index ebef51c8..ce5663c8 100644
--- a/Daily/Max_sum_combination.cpp
+++ b/Daily/Max_sum_combination.cpp
@@ -2,7 +2,6 @@
 Given two integer array A and B of size N each.
 A sum combination is made by adding one element from array A and another element of array B.
 Return the maximum K valid sum combinations from all the possible sum combinations.
-
 Note : Output array must be sorted in non-increasing order.
 
 Example 1: