GFG 1

 package com.company;

class Solution {
    int isDigitSumPalindrome(int N) {
        int sum =0;
        String s = String.valueOf(N);
        int a = s.length();
        if(a==1){
            return 1;
        }
        if(a==2){
            int d= N%10;
            int e= N/10;

            int r= d+e;
            int f= r%10;
            int g= r/10;

            if(f==g){
                return 1;
            }
            else{
                return 0;
            }
        }
        if(a>2) {
            int[] digits = new int[a];
            for (int i = 0; i < a - 2; i++) {
                int b = N % 10;
                digits[i] = b;
            }
            int y = (int) (N / Math.pow(10, a - 1));
            digits[a - 1] = y;

            for (int i = 0; i < a; i++) {
                sum = sum + digits[i];
            }

            String s1 = String.valueOf(sum);
            int a1 = s1.length();
            if(a1==2){
                int f1= sum%10;
                int g1= sum/10;

                if(f1==g1){
                    return 1;
                }
                else{
                    return 0;
                }
            }
            if (a1 > 2) {
                int[] digits1 = new int[a1];
                for (int i = 0; i < a1 - 2; i++) {
                    int b1 = sum % 10;
                    digits1[i] = b1;
                }
                int x = (int) (sum / Math.pow(10, a1 - 1));
                digits1[a1 - 1] = x;

                //  Comparision of elements in array
                int c = Math.floorDiv(a1, 2);

                for (int j = 1; j < c; j++) {

                    if (digits1[j] == digits[a1 - j - 1]) {
                        continue;
                    } else {
                        return 0;
                    }

                }
            }
        }
        return 1;

    }
}
public class CWR_StringComparision {
    public static void main(String[] args) {
      Solution obj = new Solution();
        System.out.println(obj.isDigitSumPalindrome(23294));
    }
}