Accenture Coding Questions with Answers🔥| Accenture Coding Assessment 2024-25

YouTube Link : Click Here

package Accenture_Coding_Question;

public class Reverse_A_Number {
    public static void main(String[] args) {
        int n = 12345;
        String ans = "";
        String answer = rev(n,ans);
        System.out.println(answer);

    }
    public static String rev(int n,String ans){
        if(n==0) return ans;
        ans += n%10;
        return rev(n/10,ans);
    }
}

package Accenture_Coding_Question;
import java.lang.String;
public class Count_Total_Num_OF_Character {
    public static void main(String[] args) {
        String str = "Accenture Coding Round";
        int n = str.length();
        int count = 0;
        for (int i = 0; i < n; i++) {
            if(str.charAt(i) != ' '){
                count++;
            }
            else{
                continue;
            }
        }
        System.out.println(count);
    }
}

package Accenture_Coding_Question;

public class Find_Missing_Number_Second {
    public static void main(String[] args) {
        int arr1[] = {3,0,4,2};
        int n = arr1.length;
        int sumOfArr1 = 0;
        for (int i = 0; i < n; i++) {
            sumOfArr1 += arr1[i];
        }
        int sumOfNnumber = n * (n + 1)/2;
        System.out.println(sumOfNnumber - sumOfArr1);
    }
}

package Accenture_Coding_Question;

public class Diffrence_Of_Sum {
    public static int diffOfSum(int n,int m){
        int sumOfDiv = 0;
        int sumofNotDiv = 0;
        for (int i = 1; i <= m; i++) {
            if(i%n == 0){
                sumOfDiv += i;
            }
            else{
                sumofNotDiv +=i;
            }
        }
        return Math.abs(sumofNotDiv - sumOfDiv);
    }
    public static void main(String[] args) {
        int n=4,m=20;
        int ans = diffOfSum(n,m);
        System.out.println(ans);
    }
}

package Accenture_Coding_Question;

public class Fibonacci_Series {
    public static int fib(int n){
        if(n<=1) return n;
        return fib(n-1) + fib(n-2);
    }
    public static void main(String[] args) {
        int n =5;
        int ans = fib(n);
        System.out.println(ans);
    }
}

package Accenture_Coding_Question;

public class Prime_or_Not {
    public static int primeOrNot(int n){
        int a = (int)Math.sqrt(n);
        System.out.println(a);
        for (int i = 2; i <= a; i++) {
            if(n%i == 0){
                return -1;
            }

        }
        return 1;
    }
    public static void main(String[] args) {
        int n=97;
        int ans = primeOrNot(n);
        if(ans == 1){
            System.out.println("True");
        }
        else{
            System.out.println("False");
        }
    }
}

package Accenture_Coding_Question;

public class Sum_Of_Even_Odd_index {
    public static void main(String[] args) {
        int arr[] = {9,8,7,5,4,2,3,6,4,5};
        int sumEven = 0;
        int sumOdd = 0;
        for (int i = 0; i < arr.length; i++) {
            if(i%2==0){
                sumEven += arr[i];
            }
            else{
                sumOdd += arr[i];
            }
        }
        System.out.println("Sum of Even Index " + sumEven);
        System.out.println("Sum of Odd Index " + sumOdd);
    }
}

package Accenture_Coding_Question;

public class Find_Length_Of_LastWord {
    public static void main(String[] args) {
        String str = "Harshit Tripathi ";
        String x = str.trim();
        int count = 0;
        for (int i = 0; i < x.length(); i++) {
            if(x.charAt(i) == ' '){
                count = 0;
            }
            else{
                count++;
            }
        }
        System.out.println(count);
    }
}

package Accenture_Coding_Question;

public class Find_Max_Subarray {
    public static void main(String[] args) {
        int arr[] = {-2,1,-3,4,-1,2,1,-5,4};
        int sum = 0;
        int max = Integer.MIN_VALUE;
        for (int i = 0; i < arr.length; i++) {
            sum += arr[i];
            max = Math.max(sum,max);
            if(sum < 0 ){
                sum = 0;
            }
        }
        System.out.println(max);
    }
}

package Accenture_Coding_Question;

public class Number_Palindrome_Or_Not {
    public static int palindromeOrNot(int n, int secN){
        if(n==0) return secN;
        int rev = n%10;
        secN = secN * 10 + rev;
        return palindromeOrNot(n/10,secN);
    }
    public static void main(String[] args) {
        int n = 12;
        int secN = 0;
        int ans = palindromeOrNot(n,secN);
        if(n == ans){
            System.out.println("Number is Palindrome");
        }
        else{
            System.out.println("Number is not palindrome");
        }
    }
}