Programming Interview Question: Longest Increasing Subsequence nlogn

Given an array of integers, find the longest increasing subsequence in O(nlogn) time Example:- {3,1,5,2,6,4,9} Answer:- {1,2,4,9} Source code: - https://github.com/IDeserve/learn/blob/master/LongestIncreasingSubsequence.java Longest Increasing Subsequence Algorithm is explained with examples and visualizations. Website: http://www.ideserve.co.in Facebook: https://www.facebook.com/IDeserve.co.in