CAPGEMINI came to our campus for hiring for the role of Senior Analyst in August 2019. The entire process was divided into two parts, viz Written Test and Interview. 1. WRITTEN Test : This consisted of 3 sections, namely Aptitude, Essay and Coding(Pseudo Coding, Data structure(basic)). But, take note that only the students who cleared a minimum cutoff in Aptitude and Essay were allowed to sit for coding round. Now, based on these 3 sections of written test, a shortlist was published which consisted of students who had to appear for interview. 2. INTERVIEW : This was conducted few days(Less than a week) after the written test. It had 2 sections, Technical Interview and HR interview. Questions in the former were mostly from what you have written in your CV or from SQL/Simple coding. Questions in the later part were basic questions that you can expect in a HR interview. After this interview process which lasted for a day, the final shortlist for selected candidates was announced by the HR himself.

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.