Capegemini Consulting India Private Limited interview experience Real time questions & tips from candidates to crack your interview
Data Analyst
Capegemini Consulting India Private Limited
3 rounds | 4 Coding
problems
Selected Interview preparation journey
Journey
So I started with learning basics. First, the programming language I learned was JAVA, and I started with basic conditional statements to loops and then gradually moved to data structures first, I started with simple ones like arrays and lists and then with HashSet and maps. I also started solving coding questions on different websites then, from the skills I have learned, I started using them, making some small and simple projects and applying concepts like polymorphism, exception handling, etc. I also have some background knowledge of SQL, so knowing those ideas also helped a lot as I am currently working as an ETL developer. This helped me crack the interviews
Application story
I applied on campus, and the rounds were pretty straight. First, it was an aptitude round followed by a verbal round. Then, I had a coding round, technical interview, and an HR interview.
Why selected/rejected for the role?
I was selected for this role cause because the project that I mentioned in my resume contains an AWS tool that was quite new and widely used in IoT so he asked me about the tool and we had a discussion on that topic then he asked me about exception handing in java and followed by RDBMS question as I also mentioned in my resume that I know RDBMS as well
Preparation
Duration: 2 months
Topics: Oops Concepts, Exception Handling, Threading Concepts, Data Structure (especially Arrays and List), Joins in RDBMS system , SDLC (all types most important are waterfall and agile)
Tip 1 : Do at least one mini-project and you should know the project in and out, you should have knowledge of the tools and services that you used in the project and what are they used for, how could be that project optimized for example you made a project and it can be optimized using an AWS tool which is paid but being a mini project you didn't use that service so you can mention it that it can be used in such a way that gives the impression to the interviewer that at least you have researched on the topic what you have made and plus you are aware of the new technologies that industry is working on.
Tip 2 : Practise as you go for example you learned array today then please practice some questions on it first do not try to read all in one shot and then move to practice later for each concept and solve at least 10 coding questions.
Tip 3 : Solve first and optimize later. As soon as read a question, try penning down what the first thought in your might forget about the complexity at this point just try to solve the question first, not code and test if all the things are getting passed then start optimizing. there is some time when you are not able to solve a coding question because you started with optimizing the code first. For example, you know a question you can solve by using an array still you started with HashSet thinking to reduce the complexity, and then you are not able to get that as well so first solve the question and then start improvising on it.
Application process
Where: Campus
Eligibility: 7 CGPA
Tip 1 : Make it one page, and do not clutter it
Tip 2 : Just write the information that you are confident you will answer 100% because most of the questions that will be asked to you will be based on your resume only.
Interview rounds
01
Round
Medium
Online Coding Interview
Duration90 minutes
Interview date13 Aug 2020
Coding problem1
It was in the afternoon and it was 90 minutes with different sections and you need to be passed in sub pounds as well to go to next round
1. Number Pattern
Easy
15m average time
85% success
0/40
Asked in companies
Ninja is given a pattern. Now he is asked to print the same pattern for any given 'N' number of rows.
For example Pattern for 'N' = 4 will be-
1234
123
12
1
Problem approach
Tip 1 : In these types of rounds, try to maintain your accuracy instead of the number of questions you solve
Tip 2 : Try to skip questions if you are sure either you will not be able to solve or will consume much time
02
Round
Easy
Online Coding Interview
Duration60 minutes
Interview date14 Aug 2020
Coding problem2
1. Minimum Jumps
Moderate
25m average time
75% success
0/80
Asked in companies
Bob lives with his wife in a city named Berland. Bob is a good husband, so he goes out with his wife every Friday to ‘Arcade’ mall.
‘Arcade’ is a very famous mall in Berland. It has a very unique transportation method between shops. Since the shops in the mall are laying in a straight line, you can jump on a very advanced trampoline from the shop i, and land in any shop between (i) to (i + Arr[i]), where Arr[i] is a constant given for each shop.
There are N shops in the mall, numbered from 0 to N-1. Bob's wife starts her shopping journey from shop 0 and ends it in shop N-1. As the mall is very crowded on Fridays, unfortunately, Bob gets lost from his wife. So he wants to know, what is the minimum number of trampoline jumps from shop 0 he has to make in order to reach shop N-1 and see his wife again. If it is impossible to reach the last shop, return -1.
Problem approach
1. Create jumps[] array from left to right such that jumps[i] indicate the minimum number of jumps needed to
reach arr[i] from arr[0].
2. To fill the jumps array run a nested loop inner loop counter is j and the outer loop count is i.
Outer loop from 1 to n-1 and inner loop from 0 to i.
3. If i is less than j + arr[j] then set jumps[i] to minimum of jumps[i] and jumps[j] + 1. initially set jump[i] to INT
MAX
4. Return jumps[n-1].
2. Number Of Distinct Substring
Moderate
30m average time
70% success
0/80
Asked in companies
Ninja has been given a string ‘WORD’ containing lowercase English alphabets having length ‘N’. Ninja wants to calculate the number of distinct substrings in the ‘WORD’.
For Example :
For ‘WORD’ = “abcd” and ‘N’ = 4 following are the 10 distinct substrings of ‘WORD’.
“abcd”, “abc”, “ab”, “a”, “bcd”, “bc”, “b”, “cd”, “c”, and “d”
Can you help the Ninja to find out the number of distinct substrings in the ‘WORD’?
Note :
If you are going to use variables with dynamic memory allocation then you need to release the memory associated with them at the end of your solution.
Problem approach
Naive :- The idea is to use hash table (HashSet in Java) to store all generated substrings. Finally we return size of the HashSet.
03
Round
Easy
Face to Face
Duration20 minutes
Interview date19 Aug 2020
Coding problem1
It was late afternoon, and the interview was very nice. It started with an introduction and was followed by questions on my project, some oops concepts, and then DBMS questions.
1. DBMS
Types of join in DBMS. (Learn)
Problem approach
Tip 1 : Try to give a small and crisp answer
Tip 2 : Try to explain along with a proper example
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
How do you remove whitespace from the start of a string?
Choose another skill to practice
Similar interview experiences
Data Analyst
3 rounds | 4 problems
Interviewed by Capegemini Consulting India Private Limited
Selected 
843 views
0 comments
0 upvotes
Data Analyst
3 rounds | 4 problems
Interviewed by Capegemini Consulting India Private Limited
Selected 456 views
0 comments
0 upvotes
Data Analyst
2 rounds | 4 problems
Interviewed by Capegemini Consulting India Private Limited
Selected 0 views
0 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by Capegemini Consulting India Private Limited
Selected 553 views
0 comments
0 upvotes