Date: 2011-09-27 23:30:04
My approach was to find longest common substring of the concatenation of String1 + reverse(String1) + String2 + reverse(String2)
Is there anything wrong in this approach? can anyone please give some test case?
| 22.10.12 - The problems from the Southern Subregional Programming Contest 2012 added to the problemset archive (542 - 553). |
22.10.12 - After the start of the contest the statements in PDF will be available by the link.
23.10.11 - The problems from the Southern Subregional Programming Contest 2011 added to the problemset archive (530 - 541).