Leetcode 2937. Make Three Strings Equal

Find the minimum number of right-end deletions (you may not empty a string) required to make three strings identical — equivalently compute the longest non-empty common prefix of s1, s2, s3 and return sum(len_i) - 3*L, or -1 if no such prefix exists.