Find maximum number of envelopes you can put one inside another.
Sample Input:
[[5,4],[6,4],[6,7],[2,3]]
Hints
Hint 1
Sort envelopes by width ascending, height descending
Hint 2
Find longest increasing subsequence on heights
Hint 3
Use binary search for LIS
