Constraints

• 0 <= len(paths) <= 20000
• Each directory description has length between 1 and 2000
• The total number of files across all strings is at most 100000
• 0 <= size <= 10^9
• Directory names and file names contain no spaces, and file names do not contain parentheses

Examples

Solution

def solution(paths):
    size_to_paths = {}

    for entry in paths:
        parts = entry.split()
        if not parts:
            continue

        directory = parts[0]
        for file_info in parts[1:]:
            left = file_info.rfind('(')
            right = file_info.rfind(')')
            name = file_info[:left]
            size = int(file_info[left + 1:right])
            full_path = directory + '/' + name

            if size not in size_to_paths:
                size_to_paths[size] = []
            size_to_paths[size].append(full_path)

    return [group for group in size_to_paths.values() if len(group) > 1]

Time complexity: O(T), where T is the total number of characters across all input strings. Space complexity: O(F), where F is the total number of files.

Hints

1. Use a hash map where the key is the file size and the value is the list of full paths with that size.
2. You do not need to compare every pair of files. Parse each file once, build its full path, and append it to the correct group.