diff --git a/Daily/longest_increasing_subsequence.cpp b/Daily/longest_increasing_subsequence.cpp
index 5bb29b8..ac132ee 100644
--- a/Daily/longest_increasing_subsequence.cpp
+++ b/Daily/longest_increasing_subsequence.cpp
@@ -2,7 +2,6 @@
 Given an array of integers, find the length of the longest (strictly) increasing subsequence from the given array.
 
 
-
 Input:
 N = 16
 A = {0,8,4,12,2,10,6,14,1,9,5,13,3,11,7,15}