180. Longest Common Subsequence Length

Write a function solve that finds the length of the longest common subsequence between two strings. A subsequence is a sequence that can be derived from another sequence by deleting some or no elements without changing the order.

Example:
Input: text1 = "abcde", text2 = "ace"
Output: 3

Example 2:
Input: text1 = "abc", text2 = "abc"
Output: 3

Run this challenge interactively in Python or JavaScript when the app loads.