# 8 mil

Preguntas de entrevista para Learning Development Specialist compartidas por los candidatos

## Principales preguntas de entrevista

Ordenar: Relevancia|Popular|Fecha
A un Machine Learning Software Engineer le preguntaron...21 de enero de 2010

### Suppose you have a matrix of numbers. How can you easily compute the sum of any rectangle (i.e. a range [row_start, row_end, col_start, col_end]) of those numbers? How would you code this?

7 respuestas

Compute the sum of the rectangles, for all i,j, bounded by (i,j), (i,m), (n,j), (n,m), where (n,m) is the size of the matrix M. Call that sum s(i,j). You can calculate s(i,j) by dynamic programming: s(i,j) = M(i,j) + s(i+1,j) + s(i,j+1) - s(i+1,j+1). And the sum of any rectangle can be computed from s(i,j). Menos

Awesome!!

Mostrar más respuestas

6 respuestas

What were the online coding questions like? Could you elaborate?

Object detection. Is that what yours was?

it is same as mine. Could you give me more details about the online coding? what algorithm did they test on object detection part? Menos

Mostrar más respuestas

### How have I handled conflict

6 respuestas

Clear and concise

I worked as a front desk officer where I once encountered a furious client. The client came in yelling and visibly angry, After some time, I managed to calm them down and asked what was wrong, While the client's responses were rude, I focused on their complaints and I eventually discovered one of our consultants had kept them waiting too long, I immediately apologized on behalf of the company, offered them some water and connected them with another consultant. The client then approached me after to apologize for their behaviour. Menos

I worked as a front desk officer where I once encountered a furious client. The client came in yelling and visibly angry, After some time, I managed to calm them down and asked what was wrong, While the client's responses were rude, I focused on their complaints and I eventually discovered one of our consultants had kept them waiting too long, I immediately apologized on behalf of the company, offered them some water and connected them with another consultant. The client then approached me after to apologize for their behaviour. Menos

Mostrar más respuestas

### Did you implement text analytics?

5 respuestas

Yes

No

Yes

Mostrar más respuestas

### There are 10 stacks of 10 coins each. Each coin weighs 10 gms. However, one stack of coins is defective and each coin in that stack weights only 9 gms. What is the minimum number of weights you need to take to find which stack is defective? How?

5 respuestas

You can also apply a binary search. which will give you the answer minimum 3 and max 4 Menos

Can be done in 2 weights

Can be done in 2 weights.

Mostrar más respuestas

### What are some of the projects that you have done?

4 respuestas

Do you mind to share what are the hard leetcode questions they asked during the interview? Menos

I dont think it's fair to share which question they asked. But the exact same question is on leetcode and the difficulty level is hard. Menos

What topic you are being ask from in leetcode? also did they ask you system design and CS fundamentals. Menos

Mostrar más respuestas

### Give an image, when we take 2 sub images from it, calculate the ratio similar to AnB/AuB.

4 respuestas

Coded in python but wasn't able to finish it

Can you elaborate on the question

Given a matrix and coordinates of 2 rectangles calculate the weighted IoU in linear/constant time. Menos

Mostrar más respuestas

3 respuestas

Yes

Yes

Yes

### how to sort in O(Logn) time

3 respuestas

I don't think you can sort in O(logn) because you will need to go through the whole data at least once, making it O(n). Indeed, you can do it in O(logn) if the data is guarantee with some specific constrain or relationship. I think the best you can sort a completely random data is O(nlogn). Menos

I didn't come up with the answer. it is not difficult, just not prepared

what is the question

### 1 question I had was next greatest element in an array - searching only to the right. I had a solution with O(n^2), but they said don't even bother, that's rejected

3 respuestas

If you do it backwards, you actually just need to compare the last greatest value against the next element, so should be o(n) Menos

Just use monotonic stack , it will help to get the next greatest element for every element of the array on O(n) with a space of o(n) Menos

O(n^2) solution rejected, then tried reverse search, but ran out of time

Viendo 1-10 de 8171 preguntas de entrevista