SDE - 1

1. Using which fixed roles, We can add or remove the user IDs?
2. What is a database?

Ninja has an integer array 'A' of 'N' elements. He is allowed to perform at most 'X' operations on the array.

In one operation he can increment any one element of the array by 1. An operation can be performed repeatedly on the same element.

He wants to know the longest subarray he can obtain in which all the elements of the subarray are equal.

A subarray is a contiguous part of an array.

Example :

‘N’ = '7'
'X' = 5
The following line contains 'Ai', the 'ith' element from the left.
3 4 8 5 9 6 1

Assuming 0-based indexing, Ninja can perform the operations on 'i'=2, 'A[i]' = 8 once and 'i'=3, 'A[i]' = 5 four times to obtain [3 4 9 9 9 6 1].

Thus, the longest subarray with equal elements that can be obtained is [9, 9, 9] i.e. of length 3.

Given the time in hours and minutes, you need to calculate the angle between the hour hand and the minute hand.

Note :

There can be two angles between the hour hand and minute hand, you need to print a minimum of two. Also, print the floor value of angle i.e. if the angle is 15.2, you need to print 15.

Given a sequence of n numbers a1, a2, ..., an, and a number of d-queries of the following types.

1. For each d-query (1, i, j),You have to return the number of distinct elements in the subsequence (i,j)i.e., ai, ai+1, ..., aj. where (1 ≤ i ≤ j ≤ n).
2. For each d-query (2, i, x), you have to update a[i]=x. where(1 ≤ x ≤ 10^6)

Kevin has three children and he wants to buy chocolates for them. The shopkeeper has ‘N’ boxes of chocolates (numbered from 1 to ‘N’). Each box has some amount of chocolates. If Kevin selects the “i-th” box for buying the chocolates then he must have to buy all the chocolates present in that box. Kevin wants to distribute an equal amount of chocolates among his children.

This problem is divided into 3 subproblems. You must have to solve all three subproblems.

FIRST:

You have to find the maximum number of ways in which Kevin can buy the chocolates if he is allowed to choose boxes in random order.

SECOND:

You have to find the maximum number of ways in which Kevin can buy the chocolates if he is only allowed to choose the consecutive boxes.

THIRD:

There are ‘Q’ queries given to you and each query can be of two types:

0 I V
1 L R

The first type has 0 as a first character that represents this is an update query in which you have to update the number of chocolates in the “Ith” box to ‘V’.

The second type has 1 as a first character that represents this is a range query in which you have to find the maximum number of ways in which Kevin can buy the chocolates in the range [L, R] if he is allowed to choose boxes in any order.

Note:

1. There is no need to maximize the number of chocolates bought by Kevin. 
2. Consider 1 based indexing for queries. There must be a single query of type 1. 
3. You have to take the modulo with 10^9 + 7 as the result can be very large.

Ninja is bored during his algorithm class and wants to play with numbers. He then starts quizzing people about this topic. It's your turn now!

You are given an array containing ‘N’ integers. You have to select more than one number from this array and calculate their bitwise AND, find the maximum value of bitwise AND that you can get.

For Example :

If 'N' = 6, 'ARR' = {2, 5, 5, 8, 5, 1}

You can select 'ARR[1]', 'ARR[2]' and 'ARR[4]' and you can get 'ARR[1]' & 'ARR[2]' & 'ARR[4]' = 5 & 5 & 5 = 5 as the maximum bitwise AND.
It’s not possible to get bitwise AND greater than 5 by selecting more than one integers from the array.

1. How do you handle stress?
2. What are your greatest strengths? Weaknesses?
3. What isn’t on your resume?
4. If hired, when could you start?