Communities

The Great Outdoors

Photography & Video

Scientific Speculation

Electrical Engineering

Languages & Linguistics

Software Development

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

Notifications

Mark all as read See all your notifications »

Challenges Q&A Sandbox Meta

Challenges

Posts Tags Edits

Comments on Longest Increasing Subsequence

Post

Longest Increasing Subsequence

+3

−0

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.

code-golf

posted about 4 years ago

CC BY-SA 4.0

3y ago by General Sebast1an‭

2316 reputation 17 46 243 49

Raw

Markdown

is a duplicate

This question has been asked before and has already been answered. It should be marked as a duplicate.

Please enter the URL of the proposed duplicate in the details field below.

not constructive

This question cannot be answered in a way that is helpful to anyone. It's not possible to learn something from possible answers, except for the solution for the specific problem of the asker.

[Haskell], 37 bytes f(h …

4y ago

[JavaScript (Node.js)], 70 56 …

4y ago

Japt `-h`, 12 bytes à k …

3y ago

[Husk], 10 bytes L►LfΛo …

4y ago

1 comment thread

General comments (2 comments)