What is the lenght of largest common subsequence of two round words? In a round word there is no difference from which symbol the word starts and in which direction it is read.
lcs("algorithm", "grammar") = "grma"
1≤N≤2000
http://izho.kz/uploads/izho_2013_en_inform.pdf
Do you have any solutions? Thanks for help.