I applied through college or university. The process took 1 day. I interviewed at Capgemini (Bhubaneshwar) in Aug 2017
Interview
First, there was an online written round consisting of 32 numbers of general aptitude and logical reasoning question which we had to answer in 40 minutes. I found the questions very easy and with the right amount of preparation anyone can answer all the question in the given amount of time.
Second, there was an essay compilation round in which we had to write a short essay within 240 words in half an hour. The topic was interesting and different for every candidate.
The result was announced after combining the scores of both of these rounds, and around 75 students were shortlisted from around 400 students, and we had to go through another online written round consisting of general programming and algorithm questions. The time limit was really tight, and the questions were challenging too. After this round, about 35 students were shortlisted for the interview process which happened the next day.
The interview process started after a brief presentation session which was interesting and engaging. The interview consisted of two rounds namely: Technical round and HR round.
Interview questions [1]
Question 1
Basic questions of Data Structure and SQL, Overview of the previous internship experiences and final year project
I applied through college or university. The process took 2 weeks. I interviewed at Capgemini (Airoli) in Jun 2026
Interview
1. English assessment - online
2. Technical assessment - online
2A. IT fundamentals
2B. Data Science
2C. Coding
2D. Gamified assessment (sudoku, memory assessment)
3. In-person interview - tech + HR
Coding questions:
1. Problem Statement
Given three arrays A, B, and C containing distinct integers, where:
* Array A contains N elements.
* Array B contains N − 1 elements and is formed by removing exactly one element from A.
* Array C contains N − 2 elements and is formed by removing exactly one element from B.
Write a program to identify:
1. The element X that is present in A but not in B.
2. The element Y that is present in B but not in C.
Print X and Y on separate lines.
2. Problem Statement
Given an N × N matrix of integers, find the length of the longest path consisting of consecutive numbers.
A valid path can move only in the four cardinal directions:
* Up
* Down
* Left
* Right
A move from one cell to another is allowed only if the value in the next cell is exactly 1 greater than the value in the current cell.
Return the length of the longest such consecutive sequence that can be formed in the matrix.
Interview questions [1]
Question 1
RAG implementation project explanation. LLM project explanation. And follow up questions
It was quite tricky but it's too worth it. It's totally depends upon the real time projects You have made. As final word I can say that it's totally depends upon the skills you have equipped with the role you have applied.
I registered on LinkedIn. I applied for the post. I received a call from the recruiter within the next week and then I interviewed the very next day. Within the next week I onboarded.
