Algorithms · Question 12 · Hard
What is the length of the Longest Common Subsequence (LCS) of the strings "ABCBDAB" and "BDCABA"?
- 3
- 4
- 5
- 6
Answer and explanation
Answer: B. 4
Explanation: Filling the standard LCS DP table gives 4; one such subsequence is "BCBA". No common subsequence of length 5 exists.
Previous: Insertion sort is applied to [5, 2, 4, 6, 1, 3]. What does the array look like… · Next: A 0/1 knapsack has capacity 7 kg. The items (weight, value) are: (1 kg, ₹1)…
Practise algorithms
Try a fresh set of algorithms questions with an explanation after every answer, free and without signing up: Algorithms practice. Or sit a full placement mock test.
More algorithms questions
- What does the following function return for f(4096)?
- Coins of value ₹1, ₹3 and ₹4 are available in unlimited supply. A greedy…
- Insertion sort is applied to [5, 2, 4, 6, 1, 3]. What does the array look like…
- A 0/1 knapsack has capacity 7 kg. The items (weight, value) are: (1 kg, ₹1)…
- For the naive recursive Fibonacci function below, how many times is fib called…
- Using the Master theorem, what is the solution of T(n) = 3T(n/2) + n?
- What is the best-case time complexity of linear search on an array of n…
- Which of the following sorting algorithms is stable in its standard…
- Which algorithm finds single-source shortest paths correctly even when some…
- What is the worst-case time complexity of merge sort on n elements?
More technical & programming practice
Object-Oriented Programming · DBMS · SQL · Operating Systems · Computer Networks · Software Engineering · Cloud & DevOps · GenAI Basics
LogicWiz Exams home · All practice topics · Placement mock tests · Daily 10 challenge