Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

code to find the length of the smallest string which has both, X and Y as its sub-sequences. #347

Open
wants to merge 1 commit into
base: master
Choose a base branch
from
Open

code to find the length of the smallest string which has both, X and Y as its sub-sequences. #347

wants to merge 1 commit into from

Commits on Oct 31, 2020

  1. shortestCommonSupersequence 

    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.
    @saumya0303
    saumya0303 authored Oct 31, 2020
    Configuration menu
    Copy the full SHA
    af73c92 View commit details
    Browse the repository at this point in the history