diff --git a/solutions/python/pig-latin/10/pig_latin.py b/solutions/python/pig-latin/10/pig_latin.py
new file mode 100644
index 0000000..376e4b6
--- /dev/null
+++ b/solutions/python/pig-latin/10/pig_latin.py
@@ -0,0 +1,133 @@
+"""
+The task is to translate text from English to Pig Latin.
+The translation is defined using four rules, which look at the pattern of vowels
+and consonants at the beginning of a word. These rules look at each word's use
+of vowels and consonants:
+
+vowels: the letters a, e, i, o, and u
+consonants: the other 21 letters of the English alphabet
+"""
+
+
+def translate(text: str) -> str:
+    """
+    Translate English text to Pig Latin.
+
+    :param text: The English text to translate
+    :return: The text translated to Pig Latin
+    """
+    words: list[str] = text.split(" ")
+    return " ".join(process_words(word) for word in words)
+
+
+def process_words(text: str) -> str:
+    """
+    Process a single word and convert it to Pig Latin using the four translation rules.
+
+    :param text: The English word to convert
+    :return: The word converted to Pig Latin
+    """
+    if not text:
+        return ""
+
+    # Rule 1
+    if is_vowel(text[0]) or text[:2] in ("xr", "yt"):
+        # If a word begins with a vowel,
+        # or starts with "xr" or "yt",
+        # add an "ay" sound to the end of the word.
+        return f"{text}ay"
+
+    # Rule 3
+    if is_rule_3(text):
+        # If a word starts with zero or more consonants followed by "qu", first move
+        # those consonants (if any) and the "qu" part to the end of the word, and then
+        # add an "ay" sound to the end of the word.
+        i = text.index("qu")
+        return f"{text[i + 2:]}{text[: i + 2]}ay"
+
+    # Rule 4
+    if is_rule_4(text):
+        # If a word starts with one or more consonants followed by "y", first move the
+        # consonants preceding the "y" to the end of the word, and then add an "ay" sound
+        # to the end of the word.
+        i = text.index("y")
+        return f"{text[i:]}{text[:i]}ay"
+
+    # Rule 2
+    if is_consonant(text[0]):
+        # If a word begins with one or more consonants, first move those consonants
+        # to the end of the word and then add an "ay" sound to the end of the word.
+        i = get_consonant_cluster_length(text)
+        return f"{text[i + 1:]}{text[: i + 1]}ay"
+
+    raise ValueError(f"Unhandled word in Pig Latin translation: '{text}'")
+
+
+def is_rule_3(text: str) -> bool:
+    """
+    Check if a word starts with zero or more consonants followed by "qu".
+
+    :param text:
+    :return:
+    """
+    if "qu" in text:
+        if text[:2] == "qu":
+            return True
+
+        for char in text[: text.index("qu")]:
+            if is_vowel(char):
+                return False
+        return True
+    return False
+
+
+def is_rule_4(text: str) -> bool:
+    """
+    Check if a word starts with one or more consonants followed by "y".
+
+    :param text:
+    :return:
+    """
+    if "y" in text and text[0] != "y":
+        for char in text[: text.index("y")]:
+            if is_vowel(char):
+                return False
+        return True
+    return False
+
+
+def is_vowel(char: str) -> bool:
+    """
+    Check if a character is a vowel (a, e, i, o, or u).
+
+    :param char: The character to check
+    :return: True if the character is a vowel, False otherwise
+    """
+    return char in "aeiou"
+
+
+def is_consonant(char: str) -> bool:
+    """
+    Check if a character is a consonant (one of the 21 non-vowel letters).
+
+    :param char: The character to check
+    :return: True if the character is a consonant, False otherwise
+    """
+    return char.isalpha() and not is_vowel(char)
+
+
+def get_consonant_cluster_length(text: str) -> int:
+    """
+    Find the length of the consonant cluster at the beginning of a word.
+
+    :param text: The word to analyze
+    :return: The index of the last consonant in the initial consonant cluster
+    """
+    i = 0
+    for n, char in enumerate(text):
+        if is_consonant(char):
+            i = n
+        else:
+            break
+
+    return i