Computer Science · Algorithms
The longest common subsequence of {1, 2, 3, 2, 4, 1, 2} and {2, 4, 3, 1, 2, 1} is:
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 12, 3, 1, 2, 1
- 22, 3, 2, 1✓
- 31, 3, 2, 1
- 42, 1, 2, 3
Correct answer
2, 3, 2, 1
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 Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms