Computer Science · Dynamic Programming
The worst-case time complexity of solving the Longest Common Subsequence (LCS) problem using Dynamic Programming for two sequences of lengths m and n is:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(m / n)
- 2O(log(m × n))
- 3O(m + n)
- 4O(m × n)✓
Correct answer
O(m × n)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Dynamic Programming MCQs →Want more practice questions on Dynamic Programming?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Dynamic Programming