Update appNew update is available. Click here to update.
Company

Capgemini Interview Experience for Fresher SDE - 1, Oct 2019

Posted: 13 Sep 2022
upvote
0
Selected
Interview Rounds
Application Process

Interview Process

Online Coding Interview

Moderate
Duration:
90 minutes
Interview-Date:
9 Oct 2019
Problems:
6

Online assessment consists of :-

Section 1: Pseudocode and coding round 
after this section there was english communication based assessment based on passages , jumbled words

section 2: game-based aptitude (not elimination round)

Section 3: Behaviour competency (not elimination round)

Number Of Pairs With Given Sum

You have been given an integer array/list(arr) and a number 'Sum'. Find and return the total number of pairs in the array/list which when added, results equal to the 'Sum'.

Note:
...
View more
Try Problem
See my Approach
Spiral Matrix

You are given a 2-D array 'MATRIX' of dimensions N x M, of integers. You need to return the spiral path of the matrix.

Example Of Spiral Path:

View more
Try Problem
See my Approach
Subtree of Another Tree

Given two binary trees T and S, check whether tree S has exactly the same structure and node values with a subtree of T, i.e., check if tree S is a subtree of the tree T.

View more
Try Problem
See my Approach
Output Question

What will be the output of the following code snippet?

#include int foo(int* a, int* b){    

int sum = *a + *b;    *b = *a;    

return *a = sum - *b;}

int main(){    int i = 0, j = 1, k = 2, l;   

 l = i++ || foo(&j, &k);    

printf("%d %d %d %d", i, j, k, l);    

return ...

View more
See my Approach
Technical Question

Consider the following C function

void swap ( int x, int y ){     int tmp;     tmp = x;     x = y;     y = tmp;}

In order to exchange the values of two variables a and b:a) 

Call swap (a, b)b) Call swap (&a, &b)c) swap(a, b) cannot be used as it does not return any valued) swap(a, b) cannot be used as the parameters passed b...

View more
See my Approach
Technical Question

#includeint main(){for (int x = 10; x >= 0; x--) {int z = x & (x >> 1);if (z)printf("%d ", x);}}

See my Approach
Next
Round - 2

Preparation

Duration:
4 months
Topics:
Data Structures, DBMS , OOPS, System Design, Algorithms, Dynamic Programming.
Preparation Tip

Tip 1 : Practice At least 250 Questions of coding
Tip 2 : Do at least 2 application based projects

Application Process

Where:
Campus
Eligibility:
6.5 CGPA
Resume Tip

Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Tip 3 : Project should clear.

0 upvotes
Have an interview experience that you want to contribute?
PrevPreviousNextNext
Start a Discussion