#Longest Increasing Subsequence

Implement an algorithm to find the longest increasing subsequence in a given array of integers. You can use dynamic programming with a time complexity of O(n²) or optimize your solution with binary search to achieve a time complexity of O(n log n).