Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 2937. Make Three Strings Equal
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source