diff --git a/Daily/Flip_bits.cpp b/Daily/Flip_bits.cpp
index 2763102..f457ff5 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}