Communities

Writing
Writing
Codidact Meta
Codidact Meta
The Great Outdoors
The Great Outdoors
Photography & Video
Photography & Video
Scientific Speculation
Scientific Speculation
Cooking
Cooking
Electrical Engineering
Electrical Engineering
Judaism
Judaism
Languages & Linguistics
Languages & Linguistics
Software Development
Software Development
Mathematics
Mathematics
Christianity
Christianity
Code Golf
Code Golf
Music
Music
Physics
Physics
Linux Systems
Linux Systems
Power Users
Power Users
Tabletop RPGs
Tabletop RPGs
Community Proposals
Community Proposals
tag:snake search within a tag
answers:0 unanswered questions
user:xxxx search by author id
score:0.5 posts with 0.5+ score
"snake oil" exact phrase
votes:4 posts with 4+ votes
created:<1w created < 1 week ago
post_type:xxxx type of post
Search help
Notifications
Mark all as read See all your notifications »
Challenges

Post History

71%
+3 −0
Challenges 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 inpu...

4 answers  ·  posted 4y ago by Quintec‭  ·  edited 3y ago by General Sebast1an‭

Question code-golf
#2: Post edited by user avatar General Sebast1an‭ · 2021-08-12T19:02:47Z (over 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 user avatar 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.