
    Given a collection of learning paths where each path contains a sequence of required learning activities, determine the minimum number of activities a student needs to complete among all available subject paths. The learning paths are represented as nested lists, where each inner list corresponds to a subject's sequence of activities, and the length of each inner list represents the number of required modules for that subject.
    

    
def Find_Min_Length(lst):
    """
    Given a collection of learning paths where each path contains a sequence of required learning activities, determine the minimum number of activities a student needs to complete among all available subject paths. The learning paths are represented as nested lists, where each inner list corresponds to a subject's sequence of activities, and the length of each inner list represents the number of required modules for that subject.
    

    """
def Find_Min_Length(lst):
    """
    Given a collection of learning paths where each path contains a sequence of required learning activities, determine the minimum number of activities a student needs to complete among all available subject paths. The learning paths are represented as nested lists, where each inner list corresponds to a subject's sequence of activities, and the length of each inner list represents the number of required modules for that subject.
    

    """
    minLength = min((len(x) for x in lst))
    return minLength