dist-javascript-algorithms-and-data-structures/dist/algorithms/sets/longest-common-subsequence/__test__/longestCommonSubsequence.test.js

Algorithms and data-structures implemented on JavaScript

"use strict";

var _longestCommonSubsequence = _interopRequireDefault(require("../longestCommonSubsequence"));

function _interopRequireDefault(obj) { return obj && obj.__esModule ? obj : { default: obj }; }

describe('longestCommonSubsequence', () => {
  it('should find longest common subsequence for two strings', () => {
    expect((0, _longestCommonSubsequence.default)([''], [''])).toEqual(['']);
    expect((0, _longestCommonSubsequence.default)([''], ['A', 'B', 'C'])).toEqual(['']);
    expect((0, _longestCommonSubsequence.default)(['A', 'B', 'C'], [''])).toEqual(['']);
    expect((0, _longestCommonSubsequence.default)(['A', 'B', 'C'], ['D', 'E', 'F', 'G'])).toEqual(['']);
    expect((0, _longestCommonSubsequence.default)(['A', 'B', 'C', 'D', 'G', 'H'], ['A', 'E', 'D', 'F', 'H', 'R'])).toEqual(['A', 'D', 'H']);
    expect((0, _longestCommonSubsequence.default)(['A', 'G', 'G', 'T', 'A', 'B'], ['G', 'X', 'T', 'X', 'A', 'Y', 'B'])).toEqual(['G', 'T', 'A', 'B']);
    expect((0, _longestCommonSubsequence.default)(['A', 'B', 'C', 'D', 'A', 'F'], ['A', 'C', 'B', 'C', 'F'])).toEqual(['A', 'B', 'C', 'F']);
  });
});