Problem 45473. Sub-sequence - 01

Created by Asif Newaz
Appears in Cryptography

Difficulty:Rate

Solve Later
Add To GroupÃ‚

Find the length of the longest increasing subsequence in the given array.

a=[2,4,2,1,3,5,6]
longest increasing subsequence = [2,4,5,6]
                               = [1,3,5,6]
                               = [2,3,5,6]
so, length = 4

Solve

Solution Stats

81 Solutions
16 Solvers

Last Solution submitted on Mar 18, 2025

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Group

Cryptography

10 Problems
7 Finishers

decipher the number 1 - same key for all digits :)
Decipher the number 2 - 3 keys
Decipher the number 3 - 10 keys
Decipher the number 4 - 3 keys - order [1 2 3 2 1 2 3 ......]
Cipher or Decipher the number according to the second input - 1 key for all digits
Cipher or Decipher the number according to the second input - 3 keys
Cipher or Decipher the number according to the second input - 3 keys - order [1 2 3 2 1 2 3 ......]
Cipher or decipher the number according to the second input - 10 keys
Decipher the message - same key for all digits
Cipher and Decipher the message - 3 key

Problem Recent Solvers16

Problem Tags

Community Treasure Hunt

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

Start Hunting!