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. (eg, "ace" is a subsequence of "abcde" while "aec" is not). A common subsequence of two strings is a subsequence that is common to both strings.
 
If there is no common subsequence, return 0.
 
Example 1:
Input: text1 = "abcde", text2 = "ace" 
Output: 3  
Explanation: The longest common subsequence is "ace" and its length is 3.

Example 2:
Input: text1 = "abc", text2 = "abc"
Output: 3
Explanation: The longest common subsequence is "abc" and its length is 3.

Example 3:
Input: text1 = "abc", text2 = "def"
Output: 0
Explanation: There is no such common subsequence, so the result is 0.

 
Constraints:

1 <= text1.length <= 1000
1 <= text2.length <= 1000
The input strings consist of lowercase English characters only.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = "class Solution:\n    def longestCommonSubsequence(self, text1: str, text2: str) -> int:\n        # If text1 doesn't reference the shortest string, swap them.\n        if len(text2) < len(text1):\n            text1, text2 = text2, text1\n        \n        \n        # The previous column starts with all 0's and like before is 1\n        # more than the length of the first word.\n        previous = [0] * (len(text1) + 1)\n        # Create a new array to represent the current column.\n        current = [0] * (len(text1) + 1)\n        \n        # Iterate up each column, starting from the last one.\n        for col in reversed(range(len(text2))):\n            for row in reversed(range(len(text1))):\n                if text2[col] == text1[row]:\n                    current[row] = 1 + previous[row + 1]\n                else:\n                    current[row] = max(previous[row], current[row + 1])\n            # The current column becomes the previous one.\n            previous, current = current, previous\n        \n        # The original problem's answer is in previous[0]. Return it.\n        return previous[0]\n        \n        '''\n        # Make a grid of 0's with len(text2) + 1 columns \n        # and len(text1) + 1 rows.\n        dp_grid = [[0] * (len(text2) + 1) for _ in range(len(text1) + 1)]\n        \n        # Iterate up each column, starting from the last one.\n        for col in reversed(range(len(text2))):\n            for row in reversed(range(len(text1))):\n                # If the corresponding characters for this cell are the same...\n                if text2[col] == text1[row]:\n                    dp_grid[row][col] = 1 + dp_grid[row + 1][col + 1]\n                # Otherwise they must be different...\n                else:\n                    dp_grid[row][col] = max(dp_grid[row + 1][col], dp_grid[row][col + 1])\n        \n        # The original problem's answer is in dp_grid[0][0]. Return it.\n        return dp_grid[0][0]\n        '''\n        \n        '''\n        from functools import lru_cache\n        @lru_cache(maxsize=None)\n        def memo_solve(p1, p2):\n            \n            # Base case: If either string is now empty, we can't match\n            # up anymore characters.\n            if p1 == len(text1) or p2 == len(text2):\n                return 0\n            \n            # Recursive case 1.\n            if text1[p1] == text2[p2]:\n                return 1 + memo_solve(p1 + 1, p2 + 1)\n            \n            # Recursive case 2.\n            else:\n                return max(memo_solve(p1, p2 + 1), memo_solve(p1 + 1, p2))\n            \n        return memo_solve(0, 0)\n        '''\n        \n        \n        '''\n        def memo_solve(p1, p2):\n            \n            # Base case: If either string is now empty, we can't match\n            # up anymore characters.\n            if p1 == len(text1) or p2 == len(text2):\n                return 0\n            \n            # Option 1: We don't include text1[p1] in the solution.\n            option_1 = memo_solve(p1 + 1, p2)\n            \n            # Option 2: We include text1[p1] in the solution, as long as\n            # a match for it in text2 at or after p2 exists.\n            first_occurence = text2.find(text1[p1], p2)\n            option_2 = 0\n            if first_occurence != -1:\n                option_2 = 1 + memo_solve(p1 + 1, first_occurence + 1)\n            \n            # Return the best option.\n            return max(option_1, option_2)\n                \n        return memo_solve(0, 0)'''"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'longestCommonSubsequence'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 5930