Accenture

2025 NLT

Display Mode

Jump to Section

Practice Questions20

Export

PDF

Word

Back to Accenture

Accenture 2025-nlt

1 sections, 20 questions

Practice Questions

20 questions

Question 1

Percentage Problem

Problem

The price of a product increased by 20%. By what percentage should consumption be reduced to keep expenditure same?

Solution

Let original price = ₹100, consumption = 100 units
New price = ₹120
Original expenditure = ₹10,000
New consumption = 10,000 / 120 = 83.33 units
Reduction = (100 - 83.33) / 100 × 100 = 16.67%

Question 2

Mixture Problem

Problem

A mixture contains milk and water in ratio 3:2. If 10 liters of water is added, ratio becomes 2:3. Find initial quantity of mixture.

Solution

Let initial: Milk = 3x, Water = 2x
After adding 10L water: Milk = 3x, Water = 2x + 10
3x / (2x + 10) = 2/3
9x = 4x + 20
5x = 20
x = 4
Initial quantity = 3x + 2x = 5x = 20 liters

Question 3

Profit & Loss - Successive Discounts

Problem

A shopkeeper gives two successive discounts of 10% and 20% on an item. What is the effective discount percentage?

Solution

Let MP = ₹100
After first discount: 100 - 10% = ₹90
After second discount: 90 - 20% = ₹72
Effective discount = (100 - 72) / 100 × 100 = 28%

Question 4

Time & Work - Efficiency

Problem

A is twice as efficient as B. Together they complete a work in 12 days. In how many days will A alone complete it?

Solution

Let B's efficiency = 1 unit/day
A's efficiency = 2 units/day
Together: 1 + 2 = 3 units/day
Total work = 3 × 12 = 36 units
A alone: 36 / 2 = 18 days

Question 5

Simple Interest - Rate Calculation

Problem

A sum of ₹8,000 amounts to ₹9,600 in 4 years at simple interest. Find the rate of interest per annum.

Solution

Principal = ₹8,000, Amount = ₹9,600
Interest = 9,600 - 8,000 = ₹1,600
SI = P × R × T / 100
1,600 = 8,000 × R × 4 / 100
R = (1,600 × 100) / (8,000 × 4) = 5%

Question 6

Number Series - Square Pattern

Problem

Find next number: 1, 4, 9, 16, 25, ?

Solution

Pattern: n² where n = 1, 2, 3, 4, 5…
1²=1, 2²=4, 3²=9, 4²=16, 5²=25
Next: 6² = 36

Question 7

Number Series - Prime Pattern

Problem

Find next number: 2, 3, 5, 7, 11, ?

Solution

Pattern: Prime numbers in sequence
2, 3, 5, 7, 11, 13…
Next: 13

Question 8

Coding-Decoding

Problem

If "ACCENTURE" is coded as "ERUTNECCA", how is "SYSTEM" coded?

Solution

Pattern: Letters are reversed
ACCENTURE → ERUTNECCA (reversed)
SYSTEM → METSYS (reversed)

Question 9

Blood Relations

Problem

Pointing to a photograph, a man said, "She is the daughter of my grandfather's only son." How is the man related to the person in the photograph?

Solution

Grandfather's only son = man's father
Daughter of man's father = man's sister
So the person is the man's sister

Question 10

Direction Sense

Problem

A person walks 10m north, then 5m east, then 10m south, then 5m west. Where is he from starting point?

Solution

Net north = 10 - 10 = 0
Net east = 5 - 5 = 0
He is at the starting point

Question 11

Grammar - Parallelism

Problem

Choose the correct sentence:

a) She likes reading, writing, and to dance
b) She likes reading, writing, and dancing
c) She likes to read, writing, and dancing

Solution

Parallel structure requires same form: all gerunds or all infinitives. Option b maintains parallelism with all gerunds.

Question 12

Vocabulary - Synonyms

Problem

Find the synonym of "MAGNIFICENT":

a) Ordinary
b) Splendid
c) Small
d) Ugly

Solution

Magnificent means impressively beautiful or grand, so "Splendid" is the synonym.

Question 13

Vocabulary - Antonyms

Problem

Find the antonym of "BRILLIANT":

a) Bright
b) Dull
c) Shining
d) Smart

Solution

Brilliant means very bright or intelligent, so "Dull" is the antonym.

Question 14

C Output - Post and Pre Increment

Problem

What is the output?

int main() {
    int a = 5, b = 10;
    printf("%d %d", a++, ++b);
    printf(" %d %d", a, b);
    return 0;
}

Solution

a++ uses 5, then a becomes 6
++b makes b = 11, uses value 11
First printf: 5 11
Second printf: 6 11

Question 15

Recursion - Sum

Problem

What is the output?

int sum(int n) {
    if(n == 0) return 0;
    return n + sum(n-1);
}

printf("%d", sum(5));

Solution

sum(5) = 5 + sum(4) = 5 + 10 = 15
sum(4) = 4 + sum(3) = 4 + 6 = 10
sum(3) = 3 + sum(2) = 3 + 3 = 6
sum(2) = 2 + sum(1) = 2 + 1 = 3
sum(1) = 1 + sum(0) = 1 + 0 = 1
sum(0) = 0

Question 16

Palindrome Check

Problem

Check if string is palindrome (case-insensitive).

Solution

Compare characters from both ends moving towards center.

Code

#include <string.h>
#include <ctype.h>

int is_palindrome(char str[]) {
    int left = 0, right = strlen(str) - 1;
    while (left < right) {
        if (tolower(str[left]) != tolower(str[right]))
            return 0;
        left++;
        right--;
    }
    return 1;
}

Java

public boolean isPalindrome(String str) {
    str = str.toLowerCase();
    int left = 0, right = str.length() - 1;
    while (left < right) {
        if (str.charAt(left) != str.charAt(right))
            return false;
        left++;
        right--;
    }
    return true;
}

Python

def is_palindrome(s):
    s = s.lower()
    left, right = 0, len(s) - 1
    while left < right:
        if s[left] != s[right]:
            return False
        left += 1
        right -= 1
    return True

Time: O(n)Space: O(1)

Question 17

Find Maximum Element

Problem

Find the maximum element in an array.

Solution

Iterate through array and track maximum.

Code

int findMax(int arr[], int n) {
    int max = arr[0];
    for (int i = 1; i < n; i++) {
        if (arr[i] > max)
            max = arr[i];
    }
    return max;
}

Python

def find_max(arr):
    max_val = arr[0]
    for num in arr[1:]:
        if num > max_val:
            max_val = num
    return max_val

Time: O(n)Space: O(1)

Question 18

Check Prime Number

Problem

Check if a number is prime.

Solution

Check divisibility from 2 to sqrt(n).

Code

#include <math.h>

int isPrime(int n) {
    if (n <= 1) return 0;
    if (n <= 3) return 1;
    if (n % 2 == 0 || n % 3 == 0) return 0;
    for (int i = 5; i * i <= n; i += 6) {
        if (n % i == 0 || n % (i + 2) == 0)
            return 0;
    }
    return 1;
}

Java

public boolean isPrime(int n) {
    if (n <= 1) return false;
    if (n <= 3) return true;
    if (n % 2 == 0 || n % 3 == 0) return false;
    for (int i = 5; i * i <= n; i += 6) {
        if (n % i == 0 || n % (i + 2) == 0)
            return false;
    }
    return true;
}

Python

def is_prime(n):
    if n <= 1:
        return False
    if n <= 3:
        return True
    if n % 2 == 0 or n % 3 == 0:
        return False
    i = 5
    while i * i <= n:
        if n % i == 0 or n % (i + 2) == 0:
            return False
        i += 6
    return True

Time: O(sqrt(n))Space: O(1)

Question 19

Remove Duplicates from Sorted Array

Problem

Remove duplicates from sorted array and return new length.

Solution

Use two pointers to track unique elements.

Code

int removeDuplicates(int arr[], int n) {
    if (n == 0) return 0;
    int j = 0;
    for (int i = 1; i < n; i++) {
        if (arr[i] != arr[j]) {
            j++;
            arr[j] = arr[i];
        }
    }
    return j + 1;
}

Java

public int removeDuplicates(int[] arr) {
    if (arr.length == 0) return 0;
    int j = 0;
    for (int i = 1; i < arr.length; i++) {
        if (arr[i] != arr[j]) {
            j++;
            arr[j] = arr[i];
        }
    }
    return j + 1;
}

Python

def remove_duplicates(arr):
    if not arr:
        return 0
    j = 0
    for i in range(1, len(arr)):
        if arr[i] != arr[j]:
            j += 1
            arr[j] = arr[i]
    return j + 1

Time: O(n)Space: O(1)

Question 20

Check Anagram

Problem

Check if two strings are anagrams.

Solution

Count character frequencies and compare.

Code

#include <string.h>
#include <ctype.h>

int areAnagrams(char str1[], char str2[]) {
    int count[256] = {0};
    int len1 = strlen(str1), len2 = strlen(str2);
    
    if (len1 != len2) return 0;
    
    for (int i = 0; i < len1; i++) {
        count[tolower(str1[i])]++;
        count[tolower(str2[i])]--;
    }
    
    for (int i = 0; i < 256; i++) {
        if (count[i] != 0) return 0;
    }
    return 1;
}

Python

def are_anagrams(str1, str2):
    if len(str1) != len(str2):
        return False
    return sorted(str1.lower()) == sorted(str2.lower())

Time: O(n log n)Space: O(1)

#include <string.h> #include <ctype.h> int is_palindrome(char str[]) { int left = 0, right = strlen(str) - 1; while (left < right) { if (tolower(str[left]) != tolower(str[right])) return 0; left++; right--; } return 1; }

public boolean isPalindrome(String str) { str = str.toLowerCase(); int left = 0, right = str.length() - 1; while (left < right) { if (str.charAt(left) != str.charAt(right)) return false; left++; right--; } return true; }

def is_palindrome(s): s = s.lower() left, right = 0, len(s) - 1 while left < right: if s[left] != s[right]: return False left += 1 right -= 1 return True

#include <math.h> int isPrime(int n) { if (n <= 1) return 0; if (n <= 3) return 1; if (n % 2 == 0 || n % 3 == 0) return 0; for (int i = 5; i * i <= n; i += 6) { if (n % i == 0 || n % (i + 2) == 0) return 0; } return 1; }

public boolean isPrime(int n) { if (n <= 1) return false; if (n <= 3) return true; if (n % 2 == 0 || n % 3 == 0) return false; for (int i = 5; i * i <= n; i += 6) { if (n % i == 0 || n % (i + 2) == 0) return false; } return true; }

def is_prime(n): if n <= 1: return False if n <= 3: return True if n % 2 == 0 or n % 3 == 0: return False i = 5 while i * i <= n: if n % i == 0 or n % (i + 2) == 0: return False i += 6 return True

int removeDuplicates(int arr[], int n) { if (n == 0) return 0; int j = 0; for (int i = 1; i < n; i++) { if (arr[i] != arr[j]) { j++; arr[j] = arr[i]; } } return j + 1; }

public int removeDuplicates(int[] arr) { if (arr.length == 0) return 0; int j = 0; for (int i = 1; i < arr.length; i++) { if (arr[i] != arr[j]) { j++; arr[j] = arr[i]; } } return j + 1; }

#include <string.h> #include <ctype.h> int areAnagrams(char str1[], char str2[]) { int count[256] = {0}; int len1 = strlen(str1), len2 = strlen(str2); if (len1 != len2) return 0; for (int i = 0; i < len1; i++) { count[tolower(str1[i])]++; count[tolower(str2[i])]--; } for (int i = 0; i < 256; i++) { if (count[i] != 0) return 0; } return 1; }

Accenture

Display Mode

Jump to Section

Other Content

Export

Accenture 2025-nlt

Practice Questions

Percentage Problem

Problem

Solution

Mixture Problem

Problem

Solution

Profit & Loss - Successive Discounts

Problem

Solution

Time & Work - Efficiency

Problem

Solution

Simple Interest - Rate Calculation

Problem

Solution

Number Series - Square Pattern

Problem

Solution

Number Series - Prime Pattern

Problem

Solution

Coding-Decoding

Problem

Solution

Blood Relations

Problem

Solution

Direction Sense

Problem

Solution

Grammar - Parallelism

Problem

Solution

Vocabulary - Synonyms

Problem

Solution

Vocabulary - Antonyms

Problem

Solution

C Output - Post and Pre Increment

Problem

Solution

Recursion - Sum

Problem

Solution

Palindrome Check

Problem

Solution

Code

Find Maximum Element

Problem

Solution

Code

Check Prime Number

Problem

Solution

Code

Remove Duplicates from Sorted Array

Problem

Solution

Code

Check Anagram

Problem

Solution

Code

Accenture

Display Mode

Jump to Section

Other Content

Export

Accenture 2025-nlt

Practice Questions

Percentage Problem