@dxzmpk/js-algorithms-data-structures/src/algorithms/sets/longest-common-subsequence/__test__/longestCommonSubsequence.test.js

Algorithms and data-structures implemented on JavaScript

import longestCommonSubsequence from '../longestCommonSubsequence';

describe('longestCommonSubsequence', () => {
  it('should find longest common subsequence for two strings', () => {
    expect(longestCommonSubsequence([''], [''])).toEqual(['']);

    expect(longestCommonSubsequence([''], ['A', 'B', 'C'])).toEqual(['']);

    expect(longestCommonSubsequence(['A', 'B', 'C'], [''])).toEqual(['']);

    expect(longestCommonSubsequence(
      ['A', 'B', 'C'],
      ['D', 'E', 'F', 'G'],
    )).toEqual(['']);

    expect(longestCommonSubsequence(
      ['A', 'B', 'C', 'D', 'G', 'H'],
      ['A', 'E', 'D', 'F', 'H', 'R'],
    )).toEqual(['A', 'D', 'H']);

    expect(longestCommonSubsequence(
      ['A', 'G', 'G', 'T', 'A', 'B'],
      ['G', 'X', 'T', 'X', 'A', 'Y', 'B'],
    )).toEqual(['G', 'T', 'A', 'B']);

    expect(longestCommonSubsequence(
      ['A', 'B', 'C', 'D', 'A', 'F'],
      ['A', 'C', 'B', 'C', 'F'],
    )).toEqual(['A', 'B', 'C', 'F']);
  });
});