SDE - 1

You are given an array A of length N, where N is always an odd integer. There are (N-1)/2 elements in the array that occur twice and one element which occurs once.

Your task is to find the only element that occurs once in the array.

Note: There are (N-1)/2+1 elements that are unique in the array.

Example:

Consider the array be 1,6,4,6,2,4,2
The integers 2, 4, 6 occur twice and only the integer 1 occurs once. 

You are given an array ‘arr’, your task is to find an element, such that it is strictly larger than its left and right neighbour and return its index in the array.

Note:

Assume that the first and the last element of the array is -∞. 

For Example:

You are given ‘arr’ = [4, 6, 3, 2], Here element 6 is greater than 4 as well as 3, the index of 6 is 1. Hence the answer is 1.

You have been given an array/list ‘ARR’ of integers consisting of ‘N’ integers. You are also given a size ‘M’. You need to display the median of all the subarrays of size ‘M’ and it is starting from the very left of the array.

Median is the middle value in an ordered integer array/list. If the size of the array/list is even there is no middle element. So the median is the mean of two middle values in an even size array/list.

Your task is to return the median of all the subarrays whose size is ‘M’.

Example:

Let’s say you have an array/list [1,4,3,5] and ‘M’ is 3.Then the first subarray of size 3 is [1,4,3] whose median is 3.Then the second subarray of size 3 is [4,3,5] whose median is 4. Therefore the median of all the subarrays of size 3 is [3.0,4.0].

You are given an array ‘A’ of size ‘N’. Return true if an array can be divided into groups of pairs such that XOR of each pair is equal to 0.

A pair consists of two integers.

Example : Let the array be { 1, 2, 3, 4}

One of the ways to divide it into groups of pairs is { 1, 2 } and { 3, 4}.

Ninja is planning to give ‘PACKET’ of 'N' chocolates to his friend on his birthday. Each chocolate in ‘PACKET’ has a non-negative sweetness level that denotes how sweet the chocolate is. He wants to give these chocolates to his friend such that the absolute difference between chocolate with maximum sweetness and minimum sweetness should be as minimum as possible.

In order to do this, Ninja uses a magic number, 'K' under the following conditions:

1. Using this magical number, Ninja can either increase or decrease the sweetness of each chocolate. 
2. After increasing or decreasing the sweetness, all the new sweetness values must be non-negative. 
3. Ninja must use this magic number on each chocolate exactly once.

For Example :

For ‘PACKETS’ = [1, 2, 3, 4, 5] and 'K' =  1, the absolute difference between two chocolates with maximum (5) and minimum (1) sweetness is 4. Now in order to minimize this value, Ninja increases [1, 2, 3] and decreases [4, 5] by 1 (‘K’ = 1). So, ‘PACKET’ becomes [2,3,4,3,4]. Now, the absolute difference between the two chocolates with maximum (4) and minimum (2) sweetness is 2 which is the minimum possible. 

As Ninja is busy preparing for the party, he asks you for help. Can you help Ninja determine the minimum possible difference between the maximum and minimum sweetness of chocolates in 'PACKET’ after using the magic number 'K'?

You are given a positive integer ‘N’. Your task is to print all prime numbers less than or equal to N.

Note: A prime number is a natural number that is divisible only by 1 and itself. Example - 2, 3, 17, etc.

You can assume that the value of N will always be greater than 1. So, the answer will always exist.

1- Describe a time when you experienced conflict with a coworker. How did you handle it? 

2- How does this job compare to others you might be interviewing for? 

3- What interests you about this role? 

4 - What critical feedback do you most often receive?