longest_increasing_subsequence
Find the longest increasing subsequence in an array using patience sorting, achieving O(n log n) time complexity.
Instructions
Find the longest increasing subsequence in O(n log n) time using patience sorting.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| values | Yes | Array of numbers |