<gouthampradhan>string_LongestPalindrome_1.java
public int longestPalindrome(String s) {
    Map<Character, Integer> map = new HashMap<>();
    for (char c : s.toCharArray()) {
      map.putIfAbsent(c, 0);
      int count = map.get(c);
      map.put(c, count + 1);
    }
    int max = 0;
    boolean odd = false;
    for (char c : map.keySet()) {
      int count = map.get(c);
      max += count;
      if ((count % 2) != 0) {
        max--;
        odd = true;
      }
    }
    if (odd) max++;
    return max;
  }
public int sample_funcname ( String var_1 ) {
  Map < Character , Integer > var_6 = new HashMap < > ( ) ;
  for ( char var_8 : var_1 . toCharArray ( ) ) {
    var_6 . putIfAbsent ( var_8 , 0 ) ;
    int var_12 = var_6 . get ( var_8 ) ;
    var_6 . put ( var_8 , var_12 + 1 ) ;
  }
  int var_15 = 0 ;
  boolean var_19 = false ;
  for ( char var_8 : var_6 . keySet ( ) ) {
    int var_12 = var_6 . get ( var_8 ) ;
    var_15 += var_12 ;
    if ( ( var_12 % 2 ) != 0 ) {
      var_15 -- ;
      var_19 = true ;
    }
  }
  if ( var_19 ) var_15 ++ ;
  return var_15 ;
}
