Me postulé a través de una facultad o universidad. El proceso tomó 2 días. Acudí a una entrevista en Capgemini (Jalandhar, Punjab) en sep 2019
Entrevista
It was on campus interview. Where approx 400 students participated and they shortlisted approx 100 students after first round screening test.
Then it was turn for second round which was technical round (1 to 1). In that round they focussed on our basic concepts oft the subjects and major project. Also they tried to check our programming logics by giving us some coding questions. The panelists were really experienced and helping also.
Out of 100 they selected 30 students after technical round.
Then the turn for HR round. This was also one to one round. This was mainly aimed to check ur speaking skills and confidence. Out of 30 students 27 students got the final offer.
Preguntas de entrevista [1]
Pregunta 1
Basic DBMS questions like
1. What is index.
2. Types of index.
3. What are keys and types.
4. Primary keys and foreign keys relationship
Programming questions like.
1. Program to find prime number. And their complexity. (As i gave very basic logic of O(n) they asked to further optimize it.
2. Program to rotate the array by N terms.
Me postulé a través de una facultad o universidad. El proceso tomó 2 semanas. Acudí a una entrevista en Capgemini (Airoli) en jun 2026
Entrevista
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.
Preguntas de entrevista [1]
Pregunta 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.
