Generate Combinations with Repetition

Write a Python function `combinations_with_repetition` that takes in two arguments:

1. A list of elements `lst`.
2. An integer `n` representing the length of the combinations.

The function should generate all possible combinations (with repetition) of the elements in the list of length `n` and return them as a list of tuples.

#### Example Usage
```python [main.nopy]
combinations_with_repetition(["Red", "Green", "Blue"], 1)
# Expected output: [("Red",), ("Green",), ("Blue",)]

combinations_with_repetition(["Red", "Green", "Blue"], 2)
# Expected output: [("Red", "Red"), ("Red", "Green"), ("Red", "Blue"), ("Green", "Green"), ("Green", "Blue"), ("Blue", "Blue")]

combinations_with_repetition(["Red", "Green", "Blue"], 3)
# Expected output: [("Red", "Red", "Red"), ("Red", "Red", "Green"), ("Red", "Red", "Blue"), ("Red", "Green", "Green"), ("Red", "Green", "Blue"), ("Red", "Blue", "Blue"), ("Green", "Green", "Green"), ("Green", "Green", "Blue"), ("Green", "Blue", "Blue"), ("Blue", "Blue", "Blue")]
```
from typing import List, Tuple

def combinations_with_repetition(lst: List[str], n: int) -> List[Tuple[str, ...]]:
    """
    Generate all combinations with repetition of the elements in the list.

    Args:
        lst (List[str]): The list of elements.
        n (int): The length of each combination.

    Returns:
        List[Tuple[str, ...]]: A list of tuples representing the combinations.
    """
    # Placeholder for the solution
    pass
Intermediate lists
More challenges to try
Max Difference in Pairs Count True Booleans Check Product Evenness Extract Last Character from Tuple Check Even Indices for Even Numbers Extract Rear Elements Count Array Rotations Find Tuples Divisible by K Count Positive Numbers Common Elements in Nested Lists