Capgemini Software Developer Interview Questions, Process, and Tips

Q1. Tell me about yourself.
Add your answer
Q2. Tell your strength and weakness
Add your answer

Round duration - 125 minutes
Round difficulty - Medium

This online coding and mcq test is been held on Amcat site, which is an online platform for test. This round is not much difficult.

Q1. 
Find the Duplicate Number Problem Statement
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...read more
Ans. 
Find the duplicate number in an array of integers from 0 to (N - 2).
• Iterate through the array and keep track of the frequency of each number using a hashmap.

• Return the number that has a frequency greater than 1 as it is the duplicate number.
Answered by AI
View 1 more answer
Q2. 
Minimum Operations to Make Strings Equal
Given two strings A and B consisting of lowercase English letters, determine the minimum number of pre-processing moves required on string A to make it equal to st...read more
Ans. 
The minimum number of pre-processing moves required on string A to make it equal to string B using specified operations.
• Iterate through both strings simultaneously and check for differences.

• Count the number of differences that can be fixed using the specified operations.

• Return the count as the minimum number of pre-processing moves required.
Answered by AI
Add your answer
Q3. 
Ways To Make Coin Change
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...read more
Ans. 
The task is to find the total number of ways to make change for a specified value using given denominations.
• Use dynamic programming to solve this problem efficiently.

• Create a 2D array to store the number of ways to make change for each value using different denominations.

• Iterate through the denominations and update the array based on the current denomination.

• The final answer will be in the last cell of the 2D array.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

This round is face to face round. This round is bit easy. In this round they first check our domain, then after they just check our communication skills.

Questions on Mathematics based

Pseudo codes on basic coding like core java