SDE - 2

You are given a sorted array 'arr' of distinct values and a target value 'm'. You need to search for the index of the target value in the array.

Note:

1. If the value is present in the array, return its index.
2. If the value is absent, determine the index where it would be inserted in the array while maintaining the sorted order. 
3. The given array has distinct integers.
4. The given array may be empty.

Example:

Input:  arr = [1, 2, 4, 7],  m = 6 

Output: 3

Explanation: If the given array 'arr' is: [1, 2, 4, 7] and m = 6. We insert m = 6 in the array and get 'arr' as: [1, 2, 4, 6, 7]. The position of 6 is 3 (according to 0-based indexing)

Given 2 arrays - frontend and backend tasks . each number in these array represents the complexity needed to run the task.There is a server that has to run these tasks., the server is supposed to run one frontend and one backend task together only at a timeThe aim is to have lowest complexity server- (complexity of server needed = frontend task complexity + backend task complexity) such that all the tasks can get paired . We have to return the set of pairs.constraints-each pair has to have one backend task and one frontend task one task can be mentioned in one pair only mention time complexity and space complexity

Mr. X is a professional robber planning to rob houses along a street. Each house has a certain amount of money hidden.

All houses along this street are arranged in a circle. That means the first house is the neighbour of the last one. Meanwhile, adjacent houses have a security system connected, and it will automatically contact the police if two adjacent houses are broken into on the same night.

You are given an array/list of non-negative integers 'ARR' representing the amount of money of each house. Your task is to return the maximum amount of money Mr. X can rob tonight without alerting the police.

Note:

It is possible for Mr. X to rob the same amount of money by looting two different sets of houses. Just print the maximum possible robbed amount, irrespective of sets of houses robbed.

For example:

(i) Given the input array arr[] = {2, 3, 2} the output will be 3 because Mr X cannot rob house 1 (money = 2) and then rob house 3 (money = 2), because they are adjacent houses. So, he’ll rob only house 2 (money = 3)

(ii) Given the input array arr[] = {1, 2, 3, 1} the output will be 4 because Mr X rob house 1 (money = 1) and then rob house 3 (money = 3).

(iii) Given the input array arr[] = {0} the output will be 0 because Mr. X has got nothing to rob.

You are given a stream of 'N' integers. For every 'i-th' integer added to the running list of integers, print the resulting median.

Print only the integer part of the median.

Was asked to design a notification service for website like Facebook.
Whenever someone liked our post or commented on our post

There were a lot of questions, related to my resume, past experience, the technologies i had worked on. And then there were questions regarding the technologies and tech stack that they work on as the interviewer was trying to find whether my experience matches the requirements of the job
Questions related to frontend technologies like polymer, react.
Questions from C++ and databases were also asked.

Deeper discussion about all the projects i did in the past company.