desc.json

{
  "Shortest Common Supersequence": "n computer science, the shortest common supersequence problem is a problem closely related to the longest common subsequence problem. Given two sequences X = < x1,...,xm > and Y = < y1,...,yn >, a sequence U = < u1,...,uk > is a common supersequence of X and Y if U is a supersequence of both X and Y. In other words, a shortest common supersequence of strings x and y is a shortest string z such that both x and y are subsequences of z." ,
  "Complexity": {
    "time": "$O(m\\cdot n)$",
    "space": "$O(m\\cdot n)$"
  },
  "References": [
    "<a href='https://en.wikipedia.org/wiki/Shortest_common_supersequence_problem'>Wikipedia</a>"
  ],
  "files": {
    "basic": "Shortest common supersequence"
  }
}