Question

The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using __________

(a) Recursion

(b) Dynamic programming

(c) Brute force

(d) Recursion, Dynamic programming, Brute force

The question was asked in an international level competition.

My doubt stems from Longest Increasing Subsequence in portion Dynamic Programming of Data Structures & Algorithms II

Answer 1

The correct choice is (d) Recursion, Dynamic programming, Brute force

The best explanation: The longest increasing subsequence problem can be solved using all of the mentioned methods.