Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6376 |

@mb1973 | 5578 |

@Quandray | 5231 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4510 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3412 |

Complete Leaderboard | |

Handle | Score |

@codersgroup18 | 714 |

@Manikanta punnam | 579 |

@sriramgoparaju99 | 532 |

@yashkaril4 | 517 |

@praveenbgp6 | 517 |

@prankursharma31 | 489 |

@rdakka | 465 |

@sonamnigam1999 | 441 |

@purohitmn02 | 427 |

@sonamkumari63928 | 426 |

@ShubhankarPandey | 419 |

Complete Leaderboard |

Given two strings X and Y of lengths m and n respectively, find the length of the smallest string which has both, X and Y as its sub-sequences.

Note: X and Y can have both uppercase and lowercase letters.

**Example 1**

**Input:
**X = abcd, Y = xycd
**Output: **6**
Explanation: **Shortest Common Supersequence
would be abxycd which is of length 6 and
has both the strings as its subsequences.

**Example 2**

**Input:
**X = efgh, Y = jghi
**Output: **6**
Explanation: **Shortest Common Supersequence
would be ejfghi which is of length 6 and
has both the strings as its subsequences.

**Your Task:**

Complete **shortestCommonSupersequence()** function that takes X, Y, m, and n as arguments and returns the length of the required string.

**Expected Time Complexity: **O(Length(X) * Length(Y)).

**Expected Auxiliary Space: **O(Length(X) * Length(Y)).

**Constraints:**

1<= |X|, |Y| <= 100

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes
Shortest Common Supersequence

...