SDE - 1

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:

Given array/list can contain duplicate elements.

(arr[i],arr[j]) and (arr[j],arr[i]) are considered same.

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.

A subtree of a tree T is a tree S consisting of a node in T and all of its descendants in T. The subtree corresponding to the root node is the entire tree; the subtree corresponding to any other node is called a proper subtree.

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 0;}

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 by value

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

Digit Game :-

Problem Statement: You’re giving a mathematical statement and you need to create a correct combination of digits, to make LHS = RHS. Note : One Digit may only be used once, in some cases the all the digits may not be available

Deductive Logical Thinking (Geo-Sudo Challenge)

You’re given a 4×4 or 5×5 or 6×6 grid. You’re supposed to find the missing value based on some rules

Decoding Rules

One geometrical shape can only occur once, in any row or any column

You are given ‘N’ pairs of integers in which the first number is always smaller than the second number i.e in pair (a,b) -> a < b always. Now we define a pair chain as the continuous arrangement of pairs in which a pair (c,d) can follow another pair (a,b) only when b < c.

Find the length of the longest pair chain that can be formed using the given pairs.

Example:

Given Pairs =  [3,4], [1,2], [2,3].

The length of the maximum chain will be 2. The longest chain is [1,2] -> [3,4].

Note:

1. You can select a pair only once.

2. You needn’t use up all the given pairs.

3. You can select pairs in any order. 

You are given an array Arr consisting of n integers, you need to find a valid triplet as explained below.

An array is said to have a valid triplet {arr[i], arr[j], arr[k]} if there exists three indices i, j and k such that i != j, j != k and i != j and arr[i] + arr[j] = arr[k] or arr[i] + arr[k] = arr[j] or arr[k] + arr[j] = arr[i].

For Example:

Arr = 10, 5, 5, 6, 2, 
In this array, the triplet {10, 5, 5} is valid triplet because, 5 + 5 = 10.

Note:

The elements in the array need not be distinct.

What do you know about java frameworks?

What is Java Spring Boot

What is Race round condition?

Write a Sql querry to differentiate Joins.

What is Garbage collector in JAVA?

What is encapsulation?

why you want to join Capgemini

Tell me 2 reasons why we should Hire you

In which technology you want to get your profile in Capgemini

Will u go for Masters??