Find Minimum Length Sublist

Write a Python function `find_min_length_sublist(lst)` that takes a list of lists `lst` as input and returns the sublist with the minimum length. If there are multiple sublists with the same minimum length, return the first one encountered.

#### Example Usage
```python [main.nopy]
print(find_min_length_sublist([[1], [1, 2], [1, 2, 3]]))  # Output: [1]
print(find_min_length_sublist([[1, 1], [1, 1, 1], [1, 2, 7, 8]]))  # Output: [1, 1]
print(find_min_length_sublist([['x'], ['x', 'y'], ['x', 'y', 'z']]))  # Output: ['x']
```

#### Constraints
- The input list will contain at least one sublist.
- Each sublist will have a non-negative length.
def find_min_length_sublist(lst):
    """
    Find the sublist with the minimum length in a list of lists.

    Args:
        lst (list of lists): A list containing sublists.

    Returns:
        list: The sublist with the minimum length.
    """
    # Your code here
    pass
Intermediate listsfunctions
More challenges to try
Tetrahedron Area Calculation Sort Tuples by Second Value Replace Spaces, Commas, and Dots Calculate Rectangle Area Remove Characters from String Difference Between Sum of Cubes and Sum Pack Consecutive Duplicates Nth Hexagonal Number Find Second Smallest Number Minimum Jumps to Reach Point