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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2937. Make Three Strings Equal

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact