Problem:
Score : 100 points

Problem Statement

You are given strings s and t.
Find one longest string that is a subsequence of both s and t.

Notes

A subsequence of a string x is the string obtained by removing zero or more characters from x and concatenating the remaining characters without changing the order.

Constraints

s and t are strings consisting of lowercase English letters.

1 \leq |s|, |t| \leq 3000

Input

Input is given from Standard Input in the following format:

s
t

Output

Print one longest string that is a subsequence of both s and t.
If there are multiple such strings, any of them will be accepted.

Sample Input 1

axyb
abyxb

Sample Output 1

axb

The answer is axb or ayb; either will be accepted.

Sample Input 2

aa
xayaz

Sample Output 2

aa

Sample Input 3

a
z

Sample Output 3

The answer is (an empty string).

Sample Input 4

abracadabra
avadakedavra

Sample Output 4

aaadara

Solution in JavaScript (node.js v5.12) (judge verdict: Runtime Error)

'use strict'
const lines = require('fs').readFileSync(0, 'utf8').split('\n')
const s = lines[0]
const t = lines[1]
var dp = new Array(s.length + 1).fill("");

for (let i=0;i < s.length;i++) {
  const temp = i
  const jtemp = 0
  for (let j=0;j < t.length;j++) {
    if (s.charAt(temp) == t.charAt(j)) {
      dp[i] = dp[i] + t.charAt(j)
      temp++
      jtemp = j
    }

    if (j == t.length - 1 && temp < s.length) {
      temp++
      j = jtemp
    }
  }
}
var max = ""
for (let i=0;i < dp.length;i++) {
  if (dp[i].length > max.length) max = dp[i]
}
console.log(max)