Capgemini Interview Experience for Fresher SDE - 1, Oct 2019

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:

...

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:

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.

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 ...

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...