## Software Development Manager Interview Questions

- 0of 0 votes
Design a system that will let multiple sellers upload their products to Amazon seller's programs

- 0of 0 votes
Tell me about a time you pushed your developer to take a risk

- 0of 0 votes
There 'N' different types of routers and 'J' different types of jobs to be performed on all these routers. Design a system wherein user could easily perform these jobs on these routers.

Ex- Say two types of routers are - DLink , Netgear. If user wants to change the IP address (a job), DLink exposes a public API to do it. NetGear needs the data in form of xml.

Was asked to design Entities involved and their communications, basic algorithm, data-storage logic if any.

- 1of 1 vote
Tell me a project where you had to deliver a product in 6 months and how did you approach planning for it?

- 1of 1 vote
How will you design the news feed feature in Facebook?

- 1of 1 vote
Tell me a time when you took a risk?

- 0of 0 votes
Tell me a time when you inspired your team?

- 0of 0 votes
Who was you best hire and why?

- 0of 0 votes
How do you handle a low performing employee?

- 0of 0 votes
What is your hiring strategy?

- 0of 0 votes
How will you test the efficiency of a unsupervized algorithm?

- 0of 0 votes
What is the difference between supervised and unsupervised algorithms?

- 0of 0 votes
In a customer support system how will predict number of support personnel requird on a given day?

- 0of 0 votes
Describe a recent technical project and hurdles you faced there?

- 0of 0 votes
How will you design the backend of product recommendor (You may also like these carousal) system on amazon.com

- 0of 0 votes
You have a cluster with 100 machines that need time to be synced. The central time server can only handle 10 requests at a time. How will you set this up?

- 0of 0 votes
How would you design search for a music streaming service?

- 0of 0 votes
How can we implement a tree for object in java?

for example class test

{

string name;

int id;

};

i want to implement a tree on basis of id...

- 2of 2 votes
Given a cube made of N x N x N sub-cubes, how many sub-cubes are on the outside of the cube?

- 0of 0 votes
Design an e-commerce site for infants shopping.

- 0of 0 votes
Design google for old people.

- 0of 0 votes
Design Twitter Timeline

- 0of 0 votes
c program to implement hash table in c with detailed explanation

- 0of 0 votes
In a matrix of characters, find an string. String can be in any way (all 8 neighbors to be considered), like find Microsoft in below matrix.

A-C-P-R-C

X-S-O-P-C

V-O-V-N-I

W-G-F-M-N

Q-A-T-I-T

String Microsoft is present in the matrix above ?

There also a slight variation where a diagonal neighbor is not considered.

- 2of 2 votes
Given an array of object A, and an array of object B. All A's have

different sizes, and all B's have different sizes. Any object A is of the

same size as exactly one object B. We have a function f(A, B) to compare the

size of one A and one B. But we cannot compare between two A's or two B's.

Give an algorithm to match each A with each B.

- 0of 0 votes
Suppose I am given a set of input strings input[5](five of them) and their corresponding replacement strings replace[5]. Then I am given an input text, how can I replace the strings in the text matching any of the inputs with their corresponding replacements.

Also I have to make sure that if suppose, I find a match input[0] and I replace it by replace[0], then because of that it could be possible that I have a new match for input[2] lets say because of the new characters added by replace[0]. I don't want to make replacements with replace[2].

Also I cannot use regex of java.

- 0of 0 votes
Suppose you have a collection of collection

Eg : CEO-> Vps-> GMs ->..

CEO will contain collection of VP's, VP's will have collection of GM's and so on.

Suppose you need to find a particular GM is the alias is given. Write a linq query to get the employee details if the employee alias is given.

Hint : Use Recursion + Linq

- 0of 0 votes
Given a number N, now find the smallest number K such that product of digits of K is equal to N. If there is no such K then return -1.

Suppose N = 100, then K = 455

N=26, K = -1

- -1of 1 vote
Given a number N, now find the number of occurrences of each digit 0..9 from 0 to N

Eg:

i/p: 12

o/p:

2

5

2

1

1

1

1

1

1

1

- 0of 0 votes
Given a rectangular grid of N*M (1-based indexing) in which their are k monsters on k different cells.Now we need to answer Q queries in which we will be given lowest row number(L) and highest row number(H) we need to tell maximum area of rectangle between those rows that don't have a monster.(Here area of rectangle means count of cells only)

Example : Say we have a grid of 4 * 5 (mean n=4 and m=5) and monsters are located on 7(=k) cells which are (1,3) , (1,4) , (2,1) , (2,4) , (3,2) , (4,1) , (4,2) and let we have 1 query in which L=3 and H=4 then the maximum area is 6 here.

Now if the queries are very large say 10^6.Then how to tackle this problem.Is their any dynamic approach or so for doing it?