My brute force solution.

xieguahu wrote:

I use contains() method to test the intersection instead of brutal force.

 

I think the using contains() is not the key that makes your program more effective than main. Your method tries to match substring of one string with another string, and as soon as a matching found, program does next loop-iteration (with a longer substring). If no matches for substrings of current length found, then no other (longer) substrings would match and therefore will not be checked.

In my case, program checks the length of matching part every time the commong beginning (fisrt symbols matching) found. In other words, my program would try to match 2-symbols substring, then do the same for substring of length=3, and again - for substring of length=2.

I mean, elements in S1 or S2 should be seperated by a comma ( , ). 

p0941 wrote:

API:

findLCI(String S1, String S2) : void

1) It's not case sensitive for S1 or S2

2) S1 and S2 need to be seperated by comma ( , )

It will print out the result.

 findLCI(String s1, String s2)  function.   Return type: ArrayList.   This class accept command prompt argument, with s1 and s2's elements sepearated with comma, eg. P1, p2, P3, p4.