Update Length_Of_Longest_Increasing_Subsequence.java

Author: 17tanya

DynamicProgramming/LongestIncreasingSubsequence/Length_Of_Longest_Increasing_Subsequence.java

@@ -1,7 +1,7 @@
 /*
 https://www.techiedelight.com/longest-increasing-subsequence-using-dynamic-programming/
 https://www.geeksforgeeks.org/longest-increasing-subsequence-dp-3/
-
+NOTE - This problem can be solved in a better way in O(nlogn) time using BINARY SEARCH
 
 The Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order.
 example - length of LIS for {10, 22, 9, 33, 21, 50, 41, 60, 80} is 6 and LIS is {10, 22, 33, 50, 60, 80}