Medium-EasyApplyDynamic ProgrammingMultiple Choice

What is the base case for Edit Distance when one string is empty?

Apply — Tests ability to use knowledge in practical scenarios.

Answer Options

A0 for all
Bdp[i][0]=i and dp[0][j]=j
Cdp[i][0]=1 and dp[0][j]=1
DUndefined — both must be non-empty

Want to see the correct answer?

Get the answer with a detailed explanation, plus practice 32+ more Dynamic Programming questions with adaptive quizzes and timed interviews.

See the Answer on Guru Sishya →

This question is from the Dynamic Programming topic (Algorithms).

Learn Dynamic Programming→Browse All Questions

More Dynamic Programming Questions

What two properties must a problem have to be solvable with dynamic programming?

Easy

What is the time complexity of Longest Common Subsequence for strings of length m and n?

Easy

What is the recurrence relation for Coin Change (minimum coins) DP?

Medium-Easy

Explain the difference between memoization (top-down) and tabulation (bottom-up) DP.

Medium-Easy

What is dp[i][j] in the Edit Distance recurrence?

Medium-Easy