Home Get Hired Cognizant GenC Next Coding Questions and Answers for Freshers 2025

Table of content:

Overview of Cognizant GenC Next Coding Round
Key Topics to Prepare for Cognizant GenC Next Coding
Cognizant GenC Next Coding Questions & Solution
Preparation Strategies for Cognizant GenC Next Coding
Conclusion
Frequently Asked Questions (FAQs)

Cognizant GenC Next Coding Questions and Answers for Freshers 2025

Prepare for the Cognizant GenC Next coding interview with the latest coding questions, key insights, and expert tips to help freshers ace the test. Read on for details.

7 mins read

Cognizant GenC Next Coding Questions and Answers for Freshers 2025

For freshers aspiring to make a mark in the corporate IT sector, Cognizant's GenC Next program is a gateway to a rewarding career. The program's coding round is a pivotal stage that evaluates your technical prowess, logical thinking, and problem-solving capabilities.

This article will walk you through every aspect of the coding test, offering valuable insights, tips, and resources to help you ace the challenge.

Overview of Cognizant GenC Next Coding Round

The coding round is strategically designed to identify candidates with strong analytical and programming skills. Here's what you can expect:

Category	Details
Difficulty Level	Moderate to Advanced
Duration	90-120 minutes
Number of Questions	2-3 questions
Key Topics Covered	Algorithms, Data Structures, Problem-Solving
Accepted Languages	Python, Java, C++, JavaScript, etc.

Key Topics to Prepare for Cognizant GenC Next Coding

Focusing on these topics will enhance your chances of success:

Data Structures

Arrays, Linked Lists, Stacks, Queues
Trees (Binary, BST), Graphs

Algorithms

Sorting and Searching Algorithms (QuickSort, MergeSort)
Dynamic Programming, Greedy Algorithms

Problem-Solving Techniques

Optimisation Problems
Real-life Scenarios

Programming Concepts

Object-Oriented Programming (OOP) Principles
Recursion and Iterative Solutions

Logical and Analytical Reasoning

Coding Puzzles
Pattern Recognition Problems

Cognizant GenC Next Coding Questions & Solution

Problem Statement 1

There are N suns in a galaxy, each sun has M planets, each of the M planets have some number of moons, denoted by galaxy(i)(j), where galaxy(i)(j) denotes the number of moons of the jth planet having the ith sun.

Your task is to determine the maximum number of moons in any solar system. For each sun, calculate the total number of moons across all its planets and output the highest total number of moons found in a single solar system.

Input Format

The first line of input contains two space-separated integers, N and M, representing the number of suns and the number of planets per sun, respectively.

The next N lines of input contains M space separated integers, representing the number of moons for each planet around the respective sun.

Output Format

Display a single integer denoting the maximum total number of moons in a solar system (i.e., across all planets orbiting the same sun).

Solution C++

#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;


int main() {
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    int n,m;
    cin>>n>>m;
    int ans=0;
    for(int i=0;i<n;i++){
        int sum=0;
        for(int j=0;j<m;j++){
            int a;
            cin>>a;
            sum+=a;
        }
        ans=max(ans,sum);
    }
    cout<<ans<<endl;
    return 0;
}

Solution Java

import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

    public static void main(String[] args) {
       Scanner in=new Scanner(System.in);
       int a=in.nextInt();
       int b=in.nextInt();
       int i,j,sum=0,max=0;
       for(i=0;i<a;i++)
       {
        for(j=0;j<b;j++)
        {
            int k=in.nextInt();
            sum=sum+k;
        }
        if(sum>max)
        max=sum;
        sum=0;
       }
       System.out.println(max);
    }
}

Solution Python

# Enter your code here. Read input from STDIN. Print output to STDOUT
n,m=map(int,input().split())
gal=[]
for i in range(n):
    l=list(map(int,input().split()))
    gal.append(l)
max=0
s=0
for i in gal:
    s=sum(i)
    if s>max:
        max=s
print(max)

Problem Statement 2

Melisa likes the XOR operation very much. Recently, her teacher gave her a beautiful array A = [a1, a2, ..., an], where N is the size of the array, and asked her to find the XOR of all XOR values of all possible subarrays. Subarray XORs are the XOR values of all possible subarrays of the array A.

Your task is to compute the XOR of all these subarray XOR values.

Input Format

The first line of input consists of the integer N representing the size of an array.

The second line contains N space-separated integers representing the elements of the array.

Output Format

Print the XOR of all XOR values of all possible subarrays.

Solution C++

#include <bits/stdc++.h>
using namespace std;

// Returns XOR of all subarray Xors
int getTotalXorOfSubarrayXors(vector<int> &arr, int N) {
    // Initialize result by 0 as (a XOR 0 = a)
    int res = 0;

    // Loop over all elements once
    for (int i = 0; i < N; i++) {
        // Get the frequency of the current element
        int freq = (i + 1) * (N - i);

        // If frequency is odd, include it in the result
        if (freq % 2 == 1) {
            res = res ^ arr[i];
        }
    }

    // Return the result
    return res;
}

// Driver Code
int main() {
    int N;
    cin >> N;

    vector<int> arr(N);
    for (int i = 0; i < N; i++) {
        cin >> arr[i];
    }

    cout << getTotalXorOfSubarrayXors(arr, N);
    return 0;
}

Solution Java

import java.util.Scanner;
import java.util.Vector;

public class Main {

    // Function to return XOR of all subarray XORs
    public static int getTotalXorOfSubarrayXors(Vector<Integer> arr, int N) {
        // Initialize result by 0 as (a XOR 0 = a)
        int res = 0;

        // Loop over all elements once
        for (int i = 0; i < N; i++) {
            // Get the frequency of current element
            int freq = (i + 1) * (N - i);

            // If frequency is odd, include it in the result
            if (freq % 2 == 1)
                res ^= arr.get(i);
        }

        // Return the result
        return res;
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        // Input the size of the array
        int N = scanner.nextInt();

        // Create a vector to store the elements
        Vector<Integer> arr = new Vector<>(N);

        // Input the elements of the array
        for (int i = 0; i < N; i++) {
            arr.add(scanner.nextInt());
        }

        // Get the result and print it
        System.out.println(getTotalXorOfSubarrayXors(arr, N));

        scanner.close();
    }
}

Solution Python

def get_total_xor_of_subarray_xors(arr, N):
    # Initialize result by 0 as (a XOR 0 = a)
    res = 0

    # Loop over all elements once
    for i in range(N):
        # Get the frequency of the current element
        freq = (i + 1) * (N - i)

        # If frequency is odd, include it in the result
        if freq % 2 == 1:
            res ^= arr[i]

    # Return the result
    return res


if __name__ == "__main__":
    # Input the size of the array
    N = int(input())

    # Input the elements of the array
    arr = list(map(int, input().split()))

    # Get the result and print it
    print(get_total_xor_of_subarray_xors(arr, N))

Problem Statement 3

You are an agent, to stop an attack you have to decipher a piece of encrypted code. The encrypted code contains two lines, each containing a sequence of characters. You know that to decipher the code, you have to merge the two lines by adding characters in alternating sequences. Finally, if one sequence is longer than the other, append it to the end.

Help the agent decrypt the code as soon as possible.

Input Format

The first line of the input contains an integer n — the size of the first sequence.

The second line of the input contains the first sequence.

The third line of the input contains an integer m — the size of the second sequence.

The fourth line of the input contains the second sequence.

Output Format

Print the decoded sequence of characters.

Solution C++

#include <bits/stdc++.h>
using namespace std;

int main() {
  int n; cin >> n;
  string word1; cin >> word1;
  int m; cin >> m;
  string word2; cin >> word2;

  int l = 0, r = 0;
  string str = "";
  while(l < n && r < m){
    str += word1[l++];
    str += word2[r++];        
  }
  while(l < n){
    str += word1[l++];
  }
  while(r < m){
    str += word2[r++];
  }

  cout << str << '\n';
  
  return 0;
}

Solution Java

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        // Read the size and first sequence
        int n = scanner.nextInt();
        String word1 = scanner.next();

        // Read the size and second sequence
        int m = scanner.nextInt();
        String word2 = scanner.next();

        int l = 0, r = 0;
        StringBuilder str = new StringBuilder();

        // Alternate between the characters of the two sequences
        while (l < n && r < m) {
            str.append(word1.charAt(l++));
            str.append(word2.charAt(r++));
        }

        // Append remaining characters of word1
        while (l < n) {
            str.append(word1.charAt(l++));
        }

        // Append remaining characters of word2
        while (r < m) {
            str.append(word2.charAt(r++));
        }

        // Print the result
        System.out.println(str.toString());

        scanner.close();
    }
}

Solution Python

n = int(input())
word1 = input()
m = int(input())
word2 = input()

l, r = 0, 0
result = []

# Alternate between the characters of the two sequences
while l < n and r < m:
    result.append(word1[l])
    l += 1
    result.append(word2[r])
    r += 1

# Append remaining characters of word1
while l < n:
    result.append(word1[l])
    l += 1

# Append remaining characters of word2
while r < m:
    result.append(word2[r])
    r += 1

# Print the result
print("".join(result))

Problem Statement 4

Given an array arr, your task is to replace each element in the array with the greatest element among the elements to its right. The last element of the array should be replaced with -1 since there are no elements to its right. The function should return the modified array after these transformations.

Input Format

The first line contains an integer N, representing the size of the array.

The second line contains N space-separated integers representing the elements of the array.

Output Format

A single line containing the elements of the modified array, with each element replaced by the greatest element among the elements to its right and the last element replaced by -1.

Solution C++

#include <iostream>
#include <vector>
using namespace std;

vector<int> replaceElements(vector<int>& arr) {
    int n = arr.size();
    int max = -1;

    // Iterate from the last element to the first
    for (int i = n - 1; i >= 0; --i) {
        int temp = arr[i];
        arr[i] = max;
        if (temp > max) {
            max = temp;
        }
    }
    return arr;
}

int main() {
    int n;
    cin >> n;
    vector<int> arr(n);

    // Read the input array
    for (int i = 0; i < n; ++i) {
        cin >> arr[i];
    }

    // Replace elements
    vector<int> result = replaceElements(arr);

    // Print the result
    for (int i = 0; i < n; ++i) {
        cout << result[i] << " ";
    }

    return 0;
}

Solution Java

/* package whatever; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Main
{
    public static int[] replaceElements(int[] arr) {
        int i = arr.length-1;
        int max = -1;
        while(i >= 0) {
            if(arr[i] > max) {
                int t = max;
                max = arr[i];
                arr[i--] = t;
                continue;
            }
            arr[i--] = max;
        }
        return arr;
    }
  
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
       

        Scanner scn  = new Scanner(System.in);
        int n = scn.nextInt();
        int[] arr = new int[n];
        for(int i = 0 ; i < n ; i++){
            arr[i] = scn.nextInt();
        }
        int[] ans = replaceElements(arr);
        for(int i = 0 ; i < ans.length ; i++){
            System.out.print(ans[i]+ " ");
        }
	}
}

Solution Python

n = int(input())
arr = list(map(int, input().split()))

def replace_elements(arr):
    max_val = -1
    for i in range(len(arr) - 1, -1, -1):
        temp = arr[i]
        arr[i] = max_val
        if temp > max_val:
            max_val = temp
    return arr

result = replace_elements(arr)
print(" ".join(map(str, result)))

Problem Statement 5

A toy manufacturing factory produced N toys in a day. The manager has a list of product IDs and another list containing the sizes of the corresponding toys, each of length N. In other words, the i-th integer in the product IDs list represents the product ID of the i-th toy, and the i-th integer in the sizes list represents the size of the i-th toy.

However, the manager accidentally combined these lists by placing the product IDs list in front of the sizes list, resulting in a single list of 2N elements.

You are an employee, and the manager wants you to recover the data and present it as another list of 2N elements such that the product ID of each toy is followed by its size.

Input Format

The first line of the input contains a single integer N, representing the number of toys produced.

The second line contains 2*N space-separated integers representing the merged list given to you by the manager.

Output Format

Print 2*N space-separated integers representing the list wanted by the manager

Solution C++

#include<bits/stdc++.h>
using namespace std;

int main() {
    // read inputs
    int n;
    cin >> n;
    int a[2 * n];
    for (int i = 0; i < 2 * n; i++)
        cin >> a[i];

    vector<int> res; 

    // For the first n elements, find the corresponding element after n indices
    // and push both to the result vector
    for (int i = 0; i < n; i++) {
        res.push_back(a[i]);
        res.push_back(a[i + n]);
    }

    // print the result
    for (int i : res)
        cout << i << ' ';

    return 0; 
}

Solution Java

import java.util.Scanner;
import java.util.ArrayList;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);

        // Read inputs
        int n = scanner.nextInt();
        int[] a = new int[2 * n];
        for (int i = 0; i < 2 * n; i++) {
            a[i] = scanner.nextInt();
        }

        ArrayList<Integer> res = new ArrayList<>();
        // For the first n elements, find the
        // size of the ith element and push them
        // at the end of result
        for (int i = 0; i < n; i++) {
            res.add(a[i]);
            res.add(a[i + n]);
        }

        // Print the result
        for (int i : res) {
            System.out.print(i + " ");
        }

        scanner.close();
    }
}

Solution Python

n = int(input())
lis = list(map(int, input().split()))

for i in range(n):
    print(lis[i], lis[i+n], end=" ")

Are you looking for coding assessment questions related to job placement? Click here to access coding practice sessions from moderate to challenging levels.

Preparation Strategies for Cognizant GenC Next Coding

Understand the Basics: Strengthen your fundamentals in programming and data structures.
Practice Daily: Solve problems on available online platforms to improve coding skills while effectively managing time.
Mock Tests: Simulate the coding test environment to improve time management.
Analyse Past Trends: Review question patterns from previous years for familiarity.
Learn Debugging: Familiarize yourself with debugging tools to spot errors quickly.

Conclusion

The Cognizant GenC Next coding round is a test of both your programming expertise and logical thinking. With proper preparation, consistent practice, and a strategic approach, you can excel in this round and move closer to landing your dream job at Cognizant.

Use this guide to steer your preparation in the right direction and embrace the challenges of the coding round with confidence. Good luck!

Frequently Asked Questions (FAQs)

1. What programming languages are accepted?

You can use Python, Java, C++, or JavaScript during the test.

2. What is the best way to prepare for dynamic programming questions?

Practice common DP problems like the Knapsack problem and the Fibonacci sequence.

3. Are the coding questions evaluated automatically?

Yes, most coding tests use automated platforms to evaluate your code for correctness and efficiency.

4. Can I attempt all questions in any order?

Generally, you can choose the order, but it’s wise to tackle simpler problems first.

5. How much weight does the coding round carry in the selection process?

The coding round is crucial as it showcases your technical skills and determines your progression to further rounds.

Disclaimer: While we strive for accuracy, we do not guarantee its completeness or reliability. Readers are encouraged to verify all facts and statistics from the official company website or check independently before making decisions.