Max Distance

Problem Overview

• From a list of binary strings, choose the pair with the maximum distance, where distance is the sum of lengths after removing their common prefix.
• Input: array of binary strings; Output: integer maximum distance; constraints not specified.
• Domain: string processing on binary data; uses a prefix-based distance metric relevant to data encoding or networking.
• Asked in Google interviews; a coding interview problem and typical interview question.