c2c-translator/data/geeks_for_geeks_dataset/java/LONGEST_EVEN_LENGTH_SUBSTRING_SUM_FIRST_SECOND_HALF.java
<filename>c2c-translator/data/geeks_for_geeks_dataset/java/LONGEST_EVEN_LENGTH_SUBSTRING_SUM_FIRST_SECOND_HALF.java// Copyright (c) 2019-present, Facebook, Inc.
// All rights reserved.
//
// This source code is licensed under the license found in the
// LICENSE file in the root directory of this source tree.
//

import java.util. *;
import java.util.stream.*;
import java.lang.*;
import javafx.util.Pair;
public class LONGEST_EVEN_LENGTH_SUBSTRING_SUM_FIRST_SECOND_HALF{
static int f_gold ( String str ) {
  int n = str . length ( ) ;
  int maxlen = 0 ;
  for ( int i = 0 ;
  i < n ;
  i ++ ) {
    for ( int j = i + 1 ;
    j < n ;
    j += 2 ) {
      int length = j - i + 1 ;
      int leftsum = 0 , rightsum = 0 ;
      for ( int k = 0 ;
      k < length / 2 ;
      k ++ ) {
        leftsum += ( str . charAt ( i + k ) - '0' ) ;
        rightsum += ( str . charAt ( i + k + length / 2 ) - '0' ) ;
      }
      if ( leftsum == rightsum && maxlen < length ) maxlen = length ;
    }
  }
  return maxlen ;
}


//TOFILL

public static void main(String args[]) {
    int n_success = 0;
    List<String> param0 = new ArrayList<>();
    param0.add("yQHVDWxcfsazM");
    param0.add("7889372253");
    param0.add("00");
    param0.add("N");
    param0.add("178791892313");
    param0.add("110111101111");
    param0.add("Ba");
    param0.add("320901509");
    param0.add("11");
    param0.add(" HCUbvi");
    for(int i = 0; i < param0.size(); ++i)
    {
        if(f_filled(param0.get(i)) == f_gold(param0.get(i)))
        {
            n_success+=1;
        }
    }
    System.out.println("#Results:" + n_success + ", " + param0.size());
}
}