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.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"values": "<values>"
},
"name": "longest_increasing_subsequence"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| values | Yes | Array of numbers |