Capegemini Consulting India Private Limited interview experience Real time questions & tips from candidates to crack your interview

Software Engineer

Capegemini Consulting India Private Limited
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Journey
I started with a Python specialization course. After that, I switched to C++ and began learning DSA from online resources. Along with that, I learned some CS fundamentals such as OOP, DBMS, OS, and computer networks.
Application story
I applied for the off-campus placement process. There was a total of 3 rounds: the first was a technical test, then an HR interview, and the last was a technical interview.
Why selected/rejected for the role?
I was able to clear all the rounds as I had prepared well and was patient; I also didn't lose my calm. The process might get a bit delayed, but you have to be a bit patient.
Preparation
Duration: 6 months
Topics: Topics: Logical Reasoning, Algorithms, Programming Languages: C, C++, Python, SQL (Structure Query Language)
Tip
Tip

Tip 1: Prepare your resume with good projects and keep it short; add project links.
Tip 2: Mention only those skills in which you are confident.
Tip 3: Practice coding problems on Code Studio.

Application process
Where: Referral
Eligibility: Above 7 CGPA
Resume Tip
Resume tip

Tip 1: Have Relevant Internships.
Tip 2: At least 2 projects.

Interview rounds

01
Round
Easy
Video Call
Duration60 minutes
Interview date20 Feb 2023
Coding problem2

1. N-th Fibonacci Number

Moderate
40m average time
70% success
0/80
Asked in companies
AmazonWalmartTata Consultancy Services (TCS)

You are given an integer ‘N’, your task is to find and return the N’th Fibonacci number using matrix exponentiation.

Since the answer can be very large, return the answer modulo 10^9 +7.

Fibonacci number is calculated using the following formula:
F(n) = F(n-1) + F(n-2), 
Where, F(1) = F(2) = 1.
For Example:
For ‘N’ = 5, the output will be 5.
Problem approach

As for the Fibonacci series, it is the sum of the previous two numbers. By creating a function that returns the sum of two numbers, we can solve this using dynamic programming as well.

Try solving now

2. Puzzle

At present, the ratio of the ages of Arun and Deepak is 4:3. After 6 years, Arun's age will be 26 years. What is Deepak's age at present?

Problem approach

Let the present ages of Arun and Deepak be 4x years and 3x years respectively. Then,
4x + 6 = 26 4x = 20
x = 5.
Deepak's age = 3x = 15 years.

02
Round
Easy
HR Round
Duration20 minutes
Interview date23 Feb 2023
Coding problem1

1. HR Questions

What are you most proud of?

What has been your greatest failure?

why should hire you?

why to join this company?

Problem approach

Tip 1: Be confident.
Tip 2: Speak smooth and fluent English.
Tip 3: Stay focused throughout the entire round.

03
Round
Easy
Video Call
Duration60 minutes
Interview date1 Mar 2023
Coding problem2

1. Balanced parentheses

Moderate
10m average time
90% success
0/80
Asked in companies
SnapdealDell TechnologiesOLX Group

Given an integer ‘N’ representing the number of pairs of parentheses, Find all the possible combinations of balanced parentheses with the given number of pairs of parentheses.

Note :

Conditions for valid parentheses:
1. All open brackets must be closed by the closing brackets.

2. Open brackets must be closed in the correct order.

For Example :

()()()() is a valid parentheses.
)()()( is not a valid parentheses.
Problem approach

Declare a character stack S.
Now, traverse the expression string exp.
If the current character is an opening bracket (‘(’, ‘{’, or ‘[’), then push it to the stack.
If the current character is a closing bracket (‘)’, ‘}’, or ‘]’), then pop from the stack, and if the popped character is the matching opening bracket, then it's fine; otherwise, the brackets are not balanced.
After completing the traversal, if there is any opening bracket left in the stack, the expression is "not balanced."

Try solving now

2. Word Break

Moderate
15m average time
85% success
0/80
Asked in companies
MicrosoftFacebookApple

You are given a list of “N” strings A. Your task is to check whether you can form a given target string using a combination of one or more strings of A.

Note :
You can use any string of A multiple times.
Examples :
A =[“coding”, ”ninjas”, “is”, “awesome”]  target = “codingninjas”
Ans = true as we use “coding” and “ninjas” to form “codingninjas”
Problem approach

The idea is simple: we consider each prefix and search for it in the dictionary. If the prefix is present in the dictionary, we recurse for the rest of the string (or suffix). 

If the recursive call for the suffix returns true, we return true; otherwise, we try the next prefix. If we have tried all prefixes and none of them result in a solution, we return false.

Try solving now

Here's your problem of the day

Solving this problem will increase your chance to get selected in this company

Skill covered: Programming

Which SQL keyword removes duplicate records from a result set?

Choose another skill to practice
Similar interview experiences
Software Engineer
3 rounds | 2 problems
Interviewed by Capegemini Consulting India Private Limited
589 views
0 comments
0 upvotes
Software Engineer
2 rounds | 3 problems
Interviewed by Capegemini Consulting India Private Limited
0 views
0 comments
0 upvotes
Software Engineer
2 rounds | 7 problems
Interviewed by Capegemini Consulting India Private Limited
562 views
0 comments
0 upvotes
Software Engineer
3 rounds | 5 problems
Interviewed by Capegemini Consulting India Private Limited
437 views
0 comments
0 upvotes
Companies with similar interview experiences
company logo
Software Engineer
3 rounds | 5 problems
Interviewed by Mindtree
11083 views
7 comments
0 upvotes
company logo
Software Engineer
3 rounds | 7 problems
Interviewed by Optum
7002 views
1 comments
0 upvotes
company logo
Software Engineer
5 rounds | 5 problems
Interviewed by Microsoft
8503 views
1 comments
0 upvotes