SDE - 1

Integer i
Set i = 3do
print i + 3
i = i - 1while(i not equals 0)
end while

[Note: A do-while loop is a control flow statement that executes a block of code at least once, and then repeatedly executes the given Boolean condition at the end of the block]

A) 6 6 6

B) 6 5 6

C) 5 5 5

D) 6 5 4

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

}

#include
int main()
{
int go = 5.0, num = 1*10;
do
{
num /= go;
} while(go--);
printf ("%d\n", num);
return 0;
}

a) floating point exception
b)3 6 7
c) compilation error

You are given an array of integers 'ARR' containing N elements. Each integer is in the range [1, N-1], with exactly one element repeated in the array.

Your task is to find the duplicate element. The duplicate element may be repeated more than twice in the error, but there will be exactly one element that is repeated in the array.

Note :

All the integers in the array appear only once except for precisely one integer which appears two or more times.

Given an array 'arr' with 'n' elements, the task is to rotate the array to the left by 'k' steps, where 'k' is non-negative.

Example:

'arr '= [1,2,3,4,5]
'k' = 1  rotated array = [2,3,4,5,1]
'k' = 2  rotated array = [3,4,5,1,2]
'k' = 3  rotated array = [4,5,1,2,3] and so on.

Motion Challenge :- 

Problem Statement: You’re a Jim, you love to solve puzzles, your challenge is to put the red ball into the hole, but hey, there are obstacles, some are plastic obstacles that you can move, some are hard rocks, you can’t move them. Try to do this in minimum number of steps to earn candy.

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

You are given ‘N’ integers in the form of an array ‘ARR’. Print the sorted array using the insertion sort.

Note :

No need to return anything. You should sort the array in-place.

For example :

Let ‘ARR’ be: [1, 4, 2]
The sorted array will be: [1, 2, 4].

What is selenium and Java Spring Boot.

Types of keys.
what is Equii join.

what is normalization and its types.
what are acid properties

What is Garbage collector in JAVA?
what is inheritance.
What is encapsulation?

Tell us about yourself and your family

Tell us about your projects

why you want to join Capgemini?