From 8faf0a24427e1960c54c27f59904fb210de44356 Mon Sep 17 00:00:00 2001
From: SUBHAMAY__GANGULY <71601569+STREIN-11@users.noreply.github.com>
Date: Thu, 28 Nov 2024 23:19:35 +0530
Subject: [PATCH] Update Flip_bits.cpp

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

diff --git a/Daily/Flip_bits.cpp b/Daily/Flip_bits.cpp
index 27631027..f457ff5a 100644
--- a/Daily/Flip_bits.cpp
+++ b/Daily/Flip_bits.cpp
@@ -4,7 +4,6 @@ You have to do at most one “Flip” operation of any subarray. Formally, selec
 that (0 ≤ l ≤ r < n) holds and flip the elements in this range to get the maximum ones in the final array. You can 
 possibly make zero operations to get the answer.
 
-
 Input:
 N = 5
 A[] = {1, 0, 0, 1, 0}