Vidyalelo
Data Structure · Q249

Dynamic Programming in Data Structures

Programming · Data Structure · question 249

Q249

Find the longest increasing subsequence for the given sequence: 10, -10, 12, 9, 10, 15, 13, 14

A.
{10, 12, 15}
B.
{10, 12, 13, 14}
C.
{-10, 12, 13, 14}
D.
{-10, 9, 10, 13, 14}
Answer

Answer: Option D

Solution

Answer: Option D
No explanation is given for this question Let's Discuss on Board