Please suggest me a good algorithm for this problem .
you are given n-strings 1you have to find whether a chain can be termed with all the strings given number n?
A chain can be formed b/w strings if last char of the 1st string matches with 1st char of second string. For example you are given
number of strings = 3
they can be concatenated as ->
second first third
dfgs sdfg ghjhk (characters at concatenation points are same)
so concatenated string is-dfgsdfghjhk