Computer Science · Algorithms
To compute the edit distance (Levenshtein distance) between two compliance report strings of lengths m and n using a standard dynamic programming approach, the algorithm fills a 2D table. What are the time and space complexities of this standard algorithm?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1O(m log n) time and O(m) space
- 2O(m × n) time and O(m × n) space✓
- 3O(m + n) time and O(m + n) space
- 4O(1) space and O(m + n) time
Correct answer
O(m × n) time and O(m × n) space
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