Permutations and Finding the Same String with Fewer Recursion

I am currently facing some difficulties with solving a programming problem in my course.

The problem is as follows:

given k distinct lowercase English strings, if the concatenation of the i-th and j-th string yields a new string X that can be split into two identical substrings {x,x}, please return…