Longest Common Subsequence for Three Strings

Write a function `lcs_of_three(X, Y, Z)` that computes the length of the longest common subsequence (LCS) among three given strings `X`, `Y`, and `Z`.

The LCS of three strings is the longest sequence that appears in all three strings in the same order, but not necessarily consecutively.

#### Example Usage
```python [main.nopy]
print(lcs_of_three("AGGT12", "12TXAYB", "12XBA"))  # Output: 2
print(lcs_of_three("abcd1e2", "bc12ea", "bd1ea"))  # Output: 3
```

#### Constraints
- The input strings can contain any printable characters.
- The function should return an integer representing the length of the LCS.
def lcs_of_three(X, Y, Z):
    """
    Calculate the length of the longest common subsequence among three strings.

    Args:
        X (str): The first string.
        Y (str): The second string.
        Z (str): The third string.

    Returns:
        int: The length of the longest common subsequence.
    """
    # Initialize lengths of the strings
    m, n, o = len(X), len(Y), len(Z)

    # Placeholder for the solution
    pass
Advanced strings
More challenges to try
Left Insertion Point Count 'std' Occurrences Match String with 'a' to 'b' Sum of Products of Subarrays Magic Square Check Minimum String Rotations Extract phone numbers from a string Snake to Camel Case Remove Parentheses from String Split a string into a list