title: Longest Common Palindromic Subsequence
body: <p>Is there any efficient algorithm that counts the length of Longest Common Palindromic Subsequence of two given strings?</p>
  
  <p>for example:</p>
  
  <p>string 1.  <code>afbcdfca</code></p>
  
  <p>string 2.  <code>bcadfcgyfka</code></p>
  
  <p>the LCPS is 5 and LCPS string is <code>afcfa</code>.</p>