Capegemini Consulting India Private Limited interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Capegemini Consulting India Private Limited
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 12 Months
Topics: The data structure, HR Question, Technical Question, CV, DBMS
Tip 1 : Stay smiling
Tip 2 : Be confident
Tip 3 : Follow STAR Approach
Application process
Where: Campus
Eligibility: B.tech
Tip 1 : Bold important things
Tip 2 : Keep it short and crisp
Tip 3 : Have some projects on resume.
Interview rounds
01
Round
Easy
Online Coding Interview
Duration60 Minutes
Interview date16 Jun 2021
Coding problem2
Coding round on
1. Array
2. linked list
1. Subarray With Given Sum
Moderate
15m average time
85% success
0/80
Asked in companies
Given an array ARR of N integers and an integer S. The task is to find whether there exists a subarray(positive length) of the given array such that the sum of elements of the subarray equals to S or not. If any subarray is found, return the start and end index (0 based index) of the subarray. Otherwise, consider both the START and END indexes as -1.
Note:
If two or more such subarrays exist, return any subarray.
For Example: If the given array is [1,2,3,4] and the value of S is equal to 7. Then there are two possible subarrays having sums equal to S are [1,2,3] and [3,4].
Problem approach
lass Solution
{
//Function to find a continuous sub-array which adds up to a given number.
static ArrayList subarraySum(int[] arr, int n, int s)
{
ArrayList list = new ArrayList(2);
int sum=0;
int start=1;
int end =0;
for(int i=0;is){
++start;
sum=sum-arr[start-2];
}
if(sum==s){
list.add(start);
list.add(end);
return(list);
}
}
// ArrayList array =new ArrayList(1);
list.add(-1);
return(list);
2. Reverse Linked List
Moderate
15m average time
85% success
0/80
Asked in companies
Given a singly linked list of integers. Your task is to return the head of the reversed linked list.
For example:
The given linked list is 1 -> 2 -> 3 -> 4-> NULL. Then the reverse linked list is 4 -> 3 -> 2 -> 1 -> NULL and the head of the reversed linked list will be 4.
Follow Up :
Can you solve this problem in O(N) time and O(1) space complexity?
Problem approach
sweet simple shortest possible cpp solution :-
struct Node* reverseList(struct Node *head)
{
Node *ptr=head,*temp=NULL;
while(ptr->next!=NULL){
temp=ptr->next;
ptr->next->next !=NULL
? ptr->next=ptr->next->next
: ptr->next=NULL;
temp->next=head;
head=temp;
}
return head;
}
02
Round
Medium
HR Round
Duration30 Minutes
Interview date10 Jun 2021
Coding problem1
HR Round
1. Basic HR questions
Tell me about yourself.
What are your strengths and weaknesses?
Have you faced any challenging situations? ...
Where do you see yourself in the next five years?.
Why should I hire you?
Problem approach
Tip 1 : Be confident
Tip 2 : STAR approach
Tip 3 : Be short and crisp
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What can be the possible extension for the HTML5 file?
Choose another skill to practice
Start a Discussion
Similar interview experiences
SDE - 1
2 rounds | 6 problems
Interviewed by Capegemini Consulting India Private Limited
Rejected
0 views
0 comments
0 upvotes
SDE - 1
3 rounds | 5 problems
Interviewed by Capegemini Consulting India Private Limited
Selected 265 views
0 comments
0 upvotes
SDE - 1
3 rounds | 13 problems
Interviewed by Capegemini Consulting India Private Limited
Selected 348 views
0 comments
0 upvotes
SDE - 1
2 rounds | 3 problems
Interviewed by Capegemini Consulting India Private Limited
Selected 324 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 105353 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 50245 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 31297 views
6 comments
0 upvotes