Longest Common Subsequence (#1143)
Given two strings text1 and text2, return the length of their longest common subsequence.
A subsequence of a string is a new string generated from the original string with some characters (can be none) deleted without changing the relative order of the remaining characters.
Company Tags: Amazon
Core Concept: Dynamic Programming