SDE - 1

Given a number ‘N’, you are supposed to calculate the number of 1s in the binary representation of the given number.

For example:

Given ‘N’ = 4, 
Its binary representation is 0..0100, therefore there is only 1 set bit, hence the answer will be 1.

Alex wanted to buy a new keyboard, but due to the low battery in his GPS, he had to print his route on paper, now he wants to know if he can return safely to his home following the instructions written by him. The city of Alex can be represented by a 2D plane, and every location is denoted by ('X','Y') coordinates. Alex is currently standing at ( 0, 0 ) facing north.

The printed route contains a string with characters like:

'L' : which denotes he should turn to the left of the direction he is facing.
'R' : which denotes he should turn to the right of the direction he is facing. 
'G' : which denotes he should walk in the same direction by one unit.

Determine whether he can return home safely or not by following his instruction on the printed sheet.

Note:

He can follow the same printed set of instructions as many times as wanted.

What is the race condition in OS? Explain with some examples. (Learn)

What are ACID properties in DBMS? (Learn)

You have been given an array/list of integers 'ARR' of size 'N'. Your task is to find two things-

1. The number of elements that are occurring an Odd number of times.

2. The number of elements that are occurring Even a number of times.

For Example:

ARR = [2, 1, 2, 1, 5, 5, 2]    
Output: 1 2 

2 occurs three(odd) times.
1 occurs two(even) times.
5 occurs two(even) times.

So, the total 1 element is occurring an odd number of times and 2 elements are occurring an even number of times.

What will you do If you don't like the work you are given in your team?

Where do you see yourself in the next 5 years?

What are your hobbies?