LPS algorithm fix

Author: matteomessmer

DynamicProgramming/LongestPalindromicSubsequence.java

@@ -22,11 +22,11 @@ private static String LPS(String original) {
         StringBuilder reverse = new StringBuilder(); 
         reverse.append(original); 
         reverse = reverse.reverse();
-        return recursiveLPS(original, reverse);
+        return recursiveLPS(original, reverse.toString());
     }
 
     private static String recursiveLPS(String original, String reverse) {
-        String bestResult = ""
+        String bestResult = "";
 
         //no more chars, then return empty
         if(original.length() == 0 || reverse.length() == 0) {