Short Encoding of Words Python Solution

lcpy gen -n 820   # by problem number
lcpy gen -s short_encoding_of_words   # by problem name

Input: words = ["time", "me", "bell"]
Output: 10
Explanation: A valid encoding would be s = "time#bell#" and indices = [0, 2, 5].
words[0] = "time", the substring of s starting from indices[0] = 0 to the next '#' is underlined in "time#bell#"
words[1] = "me", the substring of s starting from indices[1] = 2 to the next '#' is underlined in "ti*me*#bell#"
words[2] = "bell", the substring of s starting from indices[2] = 5 to the next '#' is underlined in "time#*bell*#"

Input: words = ["t"]
Output: 2
Explanation: A valid encoding would be s = "t#" and indices = [0].

class Solution:
    # Time: O(n * L^2) where n = len(words), L = max word length (suffix slices)
    # Space: O(n * L)
    def minimum_length_encoding(self, words: list[str]) -> int:
        unique = set(words)
        return sum(
            len(word) + 1
            for word in unique
            if not any(other.endswith(word) for other in unique if other != word)
        )