Post History
Given an array of numbers, output the length of the longest increasing (not necessarily contiguous) subsequence. It is guaranteed that there are no duplicates in the array. For example, if the inpu...
Question
code-golf
#2: Post edited
by
General Sebast1an
·
2021-08-12T19:02:47Z (about 3 years ago)
Longest Increasing Subsequence
- Given an array of numbers, output the length of the longest increasing (not necessarily contiguous) subsequence. It is guaranteed that there are no duplicates in the array. For example, if the input was `[1, 5, 2, 4]`, the answer would be `3` for the subsequence `[1, 2, 4]`.
- # More I/O Examples
- ```
- Input -> Output
- [1] -> 1
- [2, 1] -> 1
- [1, 2, 3] -> 3
- [5, 2, 1, 4, 3] -> 2
- [7, 1, 8, 10, 3, 9, 5, 4, 6, 2] -> 4
- ```
This is code golf, so shortest code wins.
- Given an array of numbers, output the length of the longest increasing (not necessarily contiguous) subsequence. It is guaranteed that there are no duplicates in the array. For example, if the input was `[1, 5, 2, 4]`, the answer would be `3` for the subsequence `[1, 2, 4]`.
- # More I/O Examples
- ```
- Input -> Output
- [1] -> 1
- [2, 1] -> 1
- [1, 2, 3] -> 3
- [5, 2, 1, 4, 3] -> 2
- [7, 1, 8, 10, 3, 9, 5, 4, 6, 2] -> 4
- ```
- This is <a class="badge is-tag">code-golf</a>, so shortest code wins.
#1: Initial revision
by
Quintec
·
2020-11-29T16:52:16Z (almost 4 years ago)
Longest Increasing Subsequence
Given an array of numbers, output the length of the longest increasing (not necessarily contiguous) subsequence. It is guaranteed that there are no duplicates in the array. For example, if the input was `[1, 5, 2, 4]`, the answer would be `3` for the subsequence `[1, 2, 4]`. # More I/O Examples ``` Input -> Output [1] -> 1 [2, 1] -> 1 [1, 2, 3] -> 3 [5, 2, 1, 4, 3] -> 2 [7, 1, 8, 10, 3, 9, 5, 4, 6, 2] -> 4 ``` This is code golf, so shortest code wins.