JSFiddle - React, Tailwind, and code Playground

by suyash

JavaScript

/*
Given two two integer arrays. Find the longest common subsequence. 
eg: a =[1 5 2 6 3 7], b = [5 6 7 1 2 3]. return [1 2 3] or [5 6 7]
*/


function largestSubSequence(sequence) {

  let sortedSequence = sequence.sort();
  document.write(sortedSequence);

  for (let i = 0; i < sortedSequence.length; i++) {

    if (sortedSequence[i] == sortedSequence[i++]) {
			console.log(sortedSequence[i]);
    }
  }
}

largestSubSequence([1, 5, 2, 6, 3, 7]);