Accenture Coding Questions

Question 1: Rat Count House (Asked in Accenture OnCampus 10 Aug 2021,

Slot 1)

Problem Description: The function accepts two positive integers ‘r’ and ‘unit’
and a positive integer array ‘arr’ of size ‘n’ as its argument ‘r’ represents the
number of rats present in an area, ‘unit’ is the amount of food each rat
consumes and each ith element of array ‘arr’ represents the amount of food
present in ‘i+1’ house number, where 0 <= i

Note: Return -1 if the array is null Return 0 if the total amount of food from
all houses is not sufficient for all the rats. Computed values lie within the
integer range.

Example: Input: r: 7 unit: 2 n: 8 arr: 2 8 3 5 7 4 1 2

Output: 4

Explanation: Total amount of food required for all rats = r * unit = 7 * 2 = 14.
The amount of food in 1st houses = 2+8+3+5 = 18. Since, amount of food in
1st 4 houses is sufficient for all the rats. Thus, output is 4.
2. Problem Description: The Binary number system only uses two digits, 0
and 1, and number system can be called binary string. You are required to
implement the following function:

int OperationsBinaryString(char* str);

The function accepts a string str as its argument. The string str consists of
binary digits separated with an alphabet as follows:

– A denotes AND operation

– B denotes OR operation

– C denotes XOR Operation

You are required to calculate the result of the string str, scanning the string
to right taking one opearation at a time, and return the same.

Note: No order of priorities of operations is required Length of str is odd If

str is NULL or None (in case of Python), return -1

Input: str: 1C0C1C1A0B1

Output: 1

Explanation: The alphabets in str when expanded becomes “1 XOR 0 XOR 1

XOR 1 AND 0 OR 1”, result of the expression becomes q, hence 1 is returned.

Sample Input: 0C1A1B1C1C1B0A0

Output: 0
Question 3: Password Checker (Asked in Accenture OnCampus 10 Aug 2021,
Slot 3)

You are given a function.

int CheckPassword(char str[], int n);

The function accepts string str of size n as an argument.

Implement the function which returns 1 if given string str is valid password
else 0. str is a valid password if it satisfies the below conditions.

– At least 4 characters

– At least one numeric digit

– At Least one Capital Letter

– Must not have space or slash (/)

– Starting character must not be a number Assumption: Input string will not
be empty.

Example:

Input: aA1_67

Output: 1

Sample Input: a987 abC012

Output: 0
Question 4: (Asked in Accenture OnCampus 11 Aug 2021, Slot 1)

You are given a function,

int findCount(int arr[], int length, int num, int diff);

The function accepts an integer array ‘arr’, its length and two integer
variables ‘num’ and ‘diff’.

Implement this function to find and return the number of elements of ‘arr’
having an absolute difference of less than or equal to ‘diff’ with ‘num’.

Note: In case there is no element in ‘arr’ whose absolute difference with

‘num’ is less than or equal to ‘diff’, return -1.

Example:

Input: arr: 12 3 14 56 77 13 num: 13 diff: 2

Output: 3

Explanation: Elements of ‘arr’ having absolute difference of less than or equal

to ‘diff’ i.e. 2 with ‘num’ i.e. 13 and 12, 13 and 14.
Question 5: (Asked in Accenture OnCampus 11 Aug 2021, Slot 2)

Implement the following Function

def differenceofSum(n. m)

The function accepts two integers n, m as arguments Find the sum of all
numbers in range from 1 to m (both inclusive) that are not divisible by n.
Return difference between sum of integers not divisible by n with sum of
numbers divisible by n. Assumption: n>0 and m>0 Sum lies between integral
range

Example

Input

n:4

m:20

Output 90

Explanation

Sum of numbers divisible by 4 are 4 + 8 + 12 + 16 + 20 = 60 Sum of numbers

not divisible by 4 are 1 +2 + 3 + 5 + 6 + 7 + 9 + 10 + 11 + 13 + 14 + 15 + 17 + 18
+ 19 = 150 Difference 150 – 60 = 90

Sample Input

n:3

m:10

Sample Output 19.

Question:6 (Asked in Accenture OnCampus 11 Aug 2021, Slot 3)

You are required to implement the following Function

def LargeSmallSum(arr)

The function accepts an integers arr of size ’length’ as its arguments you are
required to return the sum of second largest element from the even positions
and second smallest from the odd position of given ‘arr’

Assumption: All array elements are unique Treat the 0th position as even
NOTE

Return 0 if array is empty Return 0, if array length is 3 or less than 3

Example

Input: a

rr:3 2 1 7 5 4

Output: 7

Explanation: Second largest among even position elements (1 3 5) is 3

Second largest among odd position element is 4

Thus, output is 3+4 = 7

Sample Input

arr:1 8 0 2 3 5 6

Sample Output: 8
Question:7 (Asked in Accenture OnCampus 12 Aug 2021, Slot 1)

Implement the following Function def ProductSmallestPair (sum, arr)

The function accepts an integers sum and an integer array arr of size n.
Implement the function to find the pair, (arr[j], arr[k]) where j!=k, Such that
arr[j] and arr[k] are the least two elements of array (arr[j] + arr[k] <= sum)
and return the product of element of this pair

NOTE: Return -1 if array is empty or if n<2 Return 0, if no such pairs found All
computed values lie within integer range

Example: Input

sum:9

Arr:5 2 4 3 9 7 1

Output: 2

Explanation: Pair of least two element is (2, 1) 2 + 1 = 3 < 9, Product of (2, 1)

2*1 = 2. Thus, output is 2

Sample Input

sum:4

Arr:9 8 3 -7 3 9

Sample Output -21

8. (Asked in Accenture OnCampus 12 Aug 2021, Slot 2)
N-base notation is a system for writing numbers that uses only n different
symbols, This symbols are the first n symbols from the given notation
list(Including the symbol for o) Decimal to n base notation are (0:0, 1:1, 2:2,
3:3, 4:4, 5:5, 6:6, 7:7, 8:8, 9:9, 10:A,11:B and so on upto 35:Z)

Implement the following function Char* DectoNBase(int n, int num):

The function accepts positive integer n and num Implement the function to
calculate the n-base equivalent of num and return the same as a string

Steps:

1.Divide the decimal number by n, Treat the division as the integer division.

2. Write the remainder (in n-base notation)

3. Divide the quotient again by n, Treat the division as integer division
4. Repeat step 2 and 3 until the quotient is 0
The n-base value is the sequence of the remainders from last to first
Assumption: 1 < n < = 36
Example
Input n: 12
num: 718
Output
Explanation: num Divisor quotient remainder 718 12
59 10(A) 59 12 4 11(B) 4 12
0 4(4)
Sample Input
n: 21
num: 5678
Sample Output CI8
Question:9 (Asked in Accenture Offcampus 1 Aug 2021, Slot 1)

Implement the following functions.a char*MoveHyphen(char str[],int n);

The function accepts a string “str” of length ‘n’, that contains alphabets and
hyphens (-). Implement the function to move all hyphens(.) in the string to
the front of the given string.

NOTE: - Return null if str is null.

Example: -

Input: str.Move-Hyphens-to-Front

Output: -MoveHyphenstoFront

Explanation: - The string “Move-Hyphens -to-front” has 3 hyphens (.), which

are moved to the front of the string, this output is “— MoveHyphen”

Sample Input

Str: String-Compare Sample

Output- -StringCompare
Question:10 (Asked in Accenture Offcampus 1 Aug 2021, Slot 2)

Problem Statement:

A carry is a digit that is transferred to left if sum of digits exceeds 9 while

adding two numbers from right-to-left one digit at a time.

You are required to implement the following function.

Int NumberOfCarries(int num1 , int num2);

The functions accept two numbers ‘num1’ and ‘num2’ as its arguments. You
are required to calculate and return the total number of carries generated
while adding digits of two numbers ‘num1’ and ‘num2’.

Assumption: num1, num2>=0

Example:

Input Num 1: 451

Num 2: 349

Output 2

Explanation: Adding ‘num 1’ and ‘num 2’ right-to-left results in 2 carries

since ( 1+9) is 10. 1 is carried and (5+4=1) is 10, again 1 is carried. Hence 2 is
returned.

Sample Input

Num 1: 23

Num 2: 563

Output 0
Question:11 (Asked in Accenture Offcampus 1 Aug 2021, Slot 3)

Problem Statement: You are given a function, Void *ReplaceCharacter(Char

str[], int n, char ch1, char ch2); The function accepts a string ‘ str’ of length n
and two characters ‘ch1’ and ‘ch2’ as its arguments .

Implement the function to modify and return the string ‘str’ in such a way
that all occurrences of ‘ch1’ in original string are replaced by ‘ch2’ and all
occurrences of ‘ch2’ in original string are replaced by ‘ch1’.

Assumption: String Contains only lower-case alphabetical letters.

Note: Return null if string is null. If both characters are not present in string
or both of them are same, then return the string unchanged.

Example:

Input: Str: apples

ch1:a ch2:p

Output: Paales

Explanation: ‘A’ in original string is replaced with ‘p’ and ‘p’ in original string
is replaced with ‘a’, thus output is paales.

Output: apples a p paales

12. (Asked in Accenture Offcampus 2 Aug 2021, Slot 1)

Problem Statement: You are required to implement the following function.

Int OperationChoices(int c, int n, int a , int b ) The function accepts 3 positive
integers ‘a’ , ‘b’ and ‘c ‘ as its arguments. Implement the function to return.

(a+ b), if c=1 (a + b), if c=2 (a * b), if c=3 (a / b), if c =4 Assumption: All
operations will result in integer output.

Example:

Input c :1 a:12 b:16

Output: Since ‘c’=1, (12+16) is performed which is equal to 28, hence 28 is

returned.

Sample Input c: 2 a: 16 b: 20

Sample Output: -4
Question:13 (Asked in Accenture Offcampus 2 Aug 2021, Slot 2)

Problem Statement: You are given a function, Int MaxExponents (int a, int b);

You have to find and return the number between ‘a’ and ‘b’ (range inclusive
on both ends) which has the maximum exponent of 2.

The algorithm to find the number with maximum exponent of 2 between the
given range is Loop between ‘a’ and ‘b’. Let the looping variable be ‘i’. Find
the exponent (power) of 2 for each ‘i’ and store the number with maximum
exponent of 2 so far in a variable, let say ‘max’. Set ‘max’ to ‘i’ only if ‘i’ has
more exponent of 2 than ‘max’. Return ‘max’. Assumption: a <b Note: If two
or more numbers in the range have the same exponents of 2, return the
small number.

Example

Input: 7 12

Output: 8

Explanation: Exponents of 2 in: 7-0 8-3 9-0 10-1 11-0 12-2. Hence
maximum exponent of two is of 8.
14. Question:(Asked in Accenture Offcampus 2 Aug 2021, Slot 3)

Problem Statement: You are required to implement the following function:

Int Calculate(int m, int n); The function accepts 2 positive integer ‘m’ and ‘n’
as its arguments.You are required to calculate the sum of numbers divisible
both by 3 and 5, between ‘m’ and ‘n’ both inclusive and return the same.
Note 0 < m <= n

Example:

Input: m: 12 n: 50

Output :90

Explanation: The numbers divisible by both 3 and 5, between 12 and 50 both

inclusive are {15, 30, 45} and their sum is 90.

Sample Input m: 100 n: 160

Sample Output 405

15. Problem Statement: You are required to input the size of the matrix
then the elements of matrix, then you have to divide the main matrix in two
sub matrices (even and odd) in such a way that element at 0 index will be
considered as even and element at 1st index will be considered as odd and so
on. then you have to sort the even and odd matrices in ascending order then
print the sum of second largest number from both the matrices.

Example:

Enter the size of array: 5

Enter element at 0 index: 3

Enter element at 1 index: 4

Enter element at 2 index: 1

Enter element at 3 index: 7

Enter element at 4 index: 9

Sorted even array: 1 3 9

Sorted odd array: 4 7 10

16. Problem: Write a program in C to display the table of a number and print
the sum of all the multiples in it.

Test Cases:

Test Case 1:

Input: 5

Expected Result Value: 5, 10, 15, 20, 25, 30, 35, 40, 45, 50 275

Test Case 2:

Input: 12

Expected Result Value: 12, 24, 36, 48, 60, 72, 84, 96, 108, 120 660
17. Write a program in C such that it takes a lower limit and upper limit as
inputs and print all the intermediate pallindrome numbers.

Test Cases:

TestCase 1:

Input : 10 , 80

Expected Result: 11 , 22 , 33 , 44 , 55 , 66 , 77.

Test Case 2:

Input: 100,200

Expected Result: 101, 111, 121, 131, 141, 151, 161, 171, 181, 191.
18. The program is supposed to calculate the distance between three points.
For x1 = 1 y1 = 1 x2 = 2 y2 = 4 x3 = 3 y3 = 6, Distance is calculated as: sqrt(x2-
x1)2 + (y2-y1)2
19. Find the maximum value and its index in the array

Problem Statement: You are given a function, void MaxInArray(int arr[], int
length); The function accepts an integer array ‘arr’ of size ‘length’ as its
argument. Implement the function to find the maximum element of the array
and print the maximum element and its index to the standard output
(STDOUT). The maximum element and its index should be printed in separate
lines.

Note: Array index starts with 0 Maximum element and its index should be
separated by a line in the output. Assume there is only 1 maximum element
in the array. Print exactly what is asked, do not print any additional greeting
messages

Example:

Input: 23 45 82 27 66 12 78 13 71 86

Output: 86 9

Explanation: 86 is the maximum element of the array at index 9.

20. Autobiographical Number

Problem Statement: An Autobiographical Number is a number N such that

the first digit of N represents the count of how many zeroes are there in N,
the second digit represents the count of how many ones are there in N and
so on.

You are given a function, def FindAutoCount(n): The function accepts string
“n” which is a number and checks whether the number is an
autobiographical number or not.

If it is, an integer is returned, i.e. the count of distinct numbers in ‘n’. If not, it
returns 0.

Assumption:

1) The input string will not be longer than 10 characters.

2) Input string will consist of numeric characters.

Note: If string is None return 0.

Example:

Input: n: “1210” Output: 3 Explanation: 0th position in the input contains

the number of 0 present in input, i.e. 1, in 1st position the count of
number of 1s in input i.e. 2, in 2nd position the count of 2s in input i.e. 1,
and in 3rd position the count of 3s i.e. 0, so the number is an
autobiographical number. Now unique numbers in the input are 0, 1, 2, so
the count of unique numbers is 3. So, 3 is returned.