Problem 51201. Find length of longest strictly increasing subsequence

Created by Evan Braun

Solve Later

{"parts":[{"partUri":"/matlab/document.xml","contentType":"application/vnd.mathworks.matlab.code.document+xml","content":"<?xml version=\"1.0\" encoding=\"UTF-8\"?><w:document xmlns:w=\"http://schemas.openxmlformats.org/wordprocessingml/2006/main\"><w:body><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>A subsequence is a subset of the array that appears in the same relative order of the array but the elements do not necessarily have to be consecutive.</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>Example:</w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>For an array x = [8, 24, 7, 35, 23, 52, 39, 64, 78], </w:t></w:r></w:p><w:p><w:pPr><w:pStyle w:val=\"text\"/><w:jc w:val=\"left\"/></w:pPr><w:r><w:t>the length of the longest strictly increasing subsequence is 6 (8, 24, 35, 52, 64, 78).</w:t></w:r></w:p></w:body></w:document>","relationship":null}],"relationships":[{"relationshipType":"http://schemas.mathworks.com/matlab/code/2013/relationships/document","target":"/matlab/document.xml","relationshipId":"rId1"}]}

<div style = "text-align: start; line-height: 20.44px; min-height: 0px; white-space: normal; color: rgb(0, 0, 0); font-family: Menlo, Monaco, Consolas, monospace; font-style: normal; font-size: 14px; font-weight: 400; text-decoration: none solid rgb(0, 0, 0); white-space: normal; "><div style="block-size: 127px; display: block; min-width: 0px; padding-block-start: 0px; padding-top: 0px; perspective-origin: 406px 63.5px; transform-origin: 406px 63.5px; vertical-align: baseline; "><div style="block-size: 40px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 383px 20px; text-align: left; transform-origin: 383px 20px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; "><span style="">A subsequence is a subset of the array that appears in the same relative order of the array but the elements do not necessarily have to be consecutive.</span></span></div><div style="block-size: 20px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 383px 10px; text-align: left; transform-origin: 383px 10px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; "><span style="">Example:</span></span></div><div style="block-size: 20px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 383px 10px; text-align: left; transform-origin: 383px 10px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; "><span style="">For an array x = [8, 24, 7, 35, 23, 52, 39, 64, 78], </span></span></div><div style="block-size: 20px; font-family: Helvetica, Arial, sans-serif; line-height: 21px; margin-block-end: 9px; margin-block-start: 2px; margin-bottom: 9px; margin-inline-end: 10px; margin-inline-start: 4px; margin-left: 4px; margin-right: 10px; margin-top: 2px; perspective-origin: 383px 10px; text-align: left; transform-origin: 383px 10px; white-space: pre-wrap; margin-left: 4px; margin-top: 2px; margin-bottom: 9px; margin-right: 10px; "><span style="block-size: auto; display: inline; margin-block-end: 0px; margin-block-start: 0px; margin-bottom: 0px; margin-inline-end: 0px; margin-inline-start: 0px; margin-left: 0px; margin-right: 0px; margin-top: 0px; perspective-origin: 0px 0px; transform-origin: 0px 0px; "><span style="">the length of the longest strictly increasing subsequence is 6 (8, 24, 35, 52, 64, 78).</span></span></div></div></div>

Solve

Solution Stats

62 Solutions
26 Solvers

Last Solution submitted on Jan 14, 2023

Last 200 Solutions

Problem Comments

1 Comment

1 Comment

士元梁 on 24 Jul 2022

It is quite a good problem, something for nothing,

Solution Comments

Solution 8644560

1 Comment

1 Comment

yining li on 7 Jul 2022

I have to improve it

Solution 5398722

1 Comment

1 Comment

Christian Schröder on 14 Jan 2023 at 13:44

Smart.

Problem Recent Solvers26

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 51201. Find length of longest strictly increasing subsequence

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers26

Suggested Problems

More from this Author1

Problem Tags

Community Treasure Hunt

Problem 51201. Find length of longest strictly increasing subsequence

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers26

Suggested Problems

More from this Author1

Problem Tags

Community Treasure Hunt

Players