Cognizant GenC Next Technical Assessment 2025

1. An astrologer gives a matrix to De'villiers and tells him to add the largest row sum and largest column sum of the given matrix. The number which appears as a result is his lucky number for the final match jersey.

Write a program that adds up the largest row sum and the largest column sum from an N- rows*M-columns array of numbers to help De'villiers find his lucky number for the final match jersey.

As a preliminary phrase, you should reformat the sequence of numbers as a matrix, whose number of rows and columns are to be specified as arguments.

Input Specification:

Input 1: Integer for row dimension of the array

Input 2: Integer for column dimension of the array

Input 3: Array elements to be entered in row major.

Output Specifications:

Largest row sum+ Largest column sum

Example 1:

Input1:4

Input2: 4

Input3: {1,1,1,1,2,2,2,2,3,3,3,3,4,4,4,4}

Output: 26

Explanation:

The array has 4 rows (input1) and 4 columns (input2). The largest sum among the four columns is 10 and the largest sum among the four rows is 16. We get the final sum of 26 (10+16).

Example 2:

Input 1:2

Input 2: 2

Input 3: {1,2,5,6}

Output: 19

Explanation:

The array has 2 rows (input1) and 2 columns (input2). The elements in the first row are 1 and 2 and the elements in the second row are 5 and 6 (input3). The largest sum among the two columns is 8(2+6) By adding those two up. We get the final sum of 19 (11+8).

Example 3:

Input 1: 3

Input 2: 3

Input 3: {3,6,9,1,4,7,2,8,9}

2. Williamson is an analyst who needs to analyze a particular topic to perform analysis for that he needs to find a permutation of a given object. He doesn't know how to find permutations, so to simplify his work, he is hiring one software developer who can code for him and find a permutation and combination of a given object.

Consider you are giving an interview to Williamson for working with him. Find a permutation of a given input to prove that you are fit for his requirement.

Input Specification:

nCr where n and r are numbers given by Williamson to you

nCr is defined as n! / (r! x (n-r)!)

Here, n! denotes the factorial of a number. Also, you have to calculate this number as modulo

Input Specification:

Input 1: The number n.

Input 2: The number r.

Input 3: The number m,

Output specification:

The value of nCr%m.

Example 1:

Input 1: 3

Input 2: 2

Input 3: 10000000009

Output:3

Explanation:

n=3.r=2,m=100 So, n!=3!=6, r!=2!=2, (n-1)!= 1!=1.

So, nCr = (6/(2*1))%1000000009= 3.

Example 2:

input1: 5

input2: 2

input3: 1000000009

Output: 10

Explanation:

n=5,r=2, m=100 So, n!=5!=120, r!=2=2, (n-1)!= 3!=6.

So, nCr = (120/(2*6))%1000000009= 10.

3. A Derangement is a permutation of n elements, such that no element appears in its original position. For example, a derangement of {0, 1, 2, 3} is {2, 3, 1, 0}. Given a number n, find the total number of Derangements of a set of n elements.

Input Specification:

Input 1: N, the number of Objects

Output Specification:

Return the number of arrangements in which no object occurs at its original position

Example 1:

Input: n = 2

Output: 1

For two elements say {0, 1}, there is only one possible derangement {1, 0}

Example 2:

Input: n = 3

Output: 2

For three elements say {0, 1, 2}, there are two possible derangements {2, 0, 1} and {1, 2, 0}

Example 3:

Input: n = 4

Output: 9

For four elements say {0, 1, 2, 3}, there are 9 possible derangements {1, 0, 3, 2} {1, 2, 3, 0} {1, 3, 0, 2}, {2, 3, 0, 1}, {2, 0, 3, 1}, {2, 3,1, 0}, {3, 0, 1, 2}, {3, 2, 0, 1} and {3, 2, 1, 0}

4. Right angle triangle pattern

Write a program to print the right-angle triangle pattern using the '*' symbol.

Input Format:

Input consist or i integer

Output Format:

Refer sample output

Sample Input:

5

Sample Output:

*

* *

* * *

* * * *

* * * * *

5. Write a program to print the Hollow square pattern.

Input Format

Input consists of 1 integer.

Output Format

Refer sample output.

Sample Input

3

Sample output

* * *
*    *
* * *

Case 1

Input (stdin)

3

Output (stdout)

* * *
*    *
* * *

Case 2

Input (stdin)

4

Output (stdout)

* * * *
*       *
*       *
* * * *