Fixed typo in the word 'subsequnce' in shortestCommonSubsequence

Author: Felix Rilling

src/algorithms/sets/shortest-common-supersequence/shortestCommonSupersequence.js

@@ -1,4 +1,4 @@
-import longestCommonSubsequnce from '../longest-common-subsequence/longestCommonSubsequence';
+import longestCommonSubsequence from '../longest-common-subsequence/longestCommonSubsequence';
 
 /**
  * @param {string[]} set1
@@ -8,9 +8,9 @@ import longestCommonSubsequnce from '../longest-common-subsequence/longestCommon
 
 export default function shortestCommonSupersequence(set1, set2) {
   // Let's first find the longest common subsequence of two sets.
-  const lcs = longestCommonSubsequnce(set1, set2);
+  const lcs = longestCommonSubsequence(set1, set2);
 
-  // If LCS is empty then the shortest common supersequnce would be just
+  // If LCS is empty then the shortest common supersequence would be just
   // concatenation of two sequences.
   if (lcs.length === 1 && lcs[0] === '') {
     return set1.concat(set2);