Added C++ Solution

Author: FarheenB

Java/soln-dynamic-programming-problems/longest-palindromic-subsequence.java

@@ -4,7 +4,12 @@
  References-
  https://www.geeksforgeeks.org/longest-palindromic-subsequence-dp-12/
  https://leetcode.com/problems/longest-palindromic-subsequence/
-*/
+
+ NOTE: Variation of Longest Common Subsequence
+*/ 
+
+//------------------------------------------------------------------------------
+//Tabulation Approach
 
 import java.util.*;
 import java.lang.*;

Java/soln-string-problems/palindrome-longest-build.java

@@ -14,15 +14,13 @@ public int longestPalindrome(String s) {
         HashMap<Character,Integer> map=new HashMap<>();
         char[] char_s=s.toCharArray();
 
-        for(char ch:char_s){
+        for(char ch:char_s)
             map.put(ch,map.getOrDefault(ch,0)+1);
-        }
 
         int flag=0;
         for(char key:map.keySet()){
-            if(map.get(key)%2!=0){
+            if(map.get(key)%2!=0)
                 flag++;
-            }
         }
         return flag>0?s.length()-flag+1:s.length();
     }