From 7fea0b3051e323e55584469a922bb41014716abc Mon Sep 17 00:00:00 2001
From: STREIN_11 <71601569+STREIN-11@users.noreply.github.com>
Date: Wed, 20 Sep 2023 20:39:23 +0530
Subject: [PATCH] Update coin_change.cpp

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

diff --git a/Daily/coin_change.cpp b/Daily/coin_change.cpp
index aa55fc23..40718299 100644
--- a/Daily/coin_change.cpp
+++ b/Daily/coin_change.cpp
@@ -3,7 +3,6 @@ Given an integer array coins[ ] of size N representing different denominations o
 by using different combinations from coins[ ].  
 Note: Assume that you have an infinite supply of each type of coin. And you can use any coin as many times as you want.
 
-
 Input:
 N = 3, sum = 4
 coins = {1,2,3}