Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 4 settimane. Ho sostenuto un colloquio presso Capgemini (Mumbai) nel mese di ott 2021
Colloquio
Initial rounds were basic coding and game-behaviour based. Then there was the technical round. It was mostly centred around OOPs concepts and my project work. Some questions were from basic data structures and problem solving.
Project and resume based questions
Basic HR
The most difficult (relatively) question was
create a function to delete the second last node of a linked list. So you can see that interview wasn't too difficult but had a vast breadth (Questions were from many nooks and corners)
Domande di colloquio [1]
Domanda 1
What is meant by Data hiding in OOPs?
What is benefit of developing software using OOPs?
Why is Java platform independent?
Why are trees called as recursive data structures?
What is an advantage of LinkedList over Arrays?
Ho presentato la mia candidatura tramite l'università. La procedura ha richiesto 2 settimane. Ho sostenuto un colloquio presso Capgemini (Airoli) nel mese di giu 2026
Colloquio
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.
Domande di colloquio [1]
Domanda 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.
Ho sostenuto un colloquio presso Capgemini (Poona)
Colloquio
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.
