Roman Romanovsky rromanovsky
rromanovsky
/ longest-common-subsequence.js
Last active
September 24, 2019 15:01
Google's interview question (https://www.youtube.com/watch?v=10WnvBk9sZc)
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| const input = [ | |
| ['', ''], | |
| ['ABAZDC', 'BACBAD'], | |
| ['BACBAD', 'ABAZDC'], | |
| ['AGGTAB', 'GXTXAYB'], | |
| ['ABBA', 'BABAABAB'], | |
| ['GT', 'XCDFGRGDTRIFG'], | |
| ]; | |
| const output = [ |