# 4 k

Questions d'entretien pour Machine Learning Intern partagées par les candidats

## Principales questions d'entretien

Trier: Pertinence|Populaires|Date
On a demandé à Machine Learning Software Engineer...21 janvier 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 réponses

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). Moins

Awesome!!

Afficher Plus de réponses

6 réponses

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? Moins

Afficher Plus de réponses

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

4 réponses

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

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. Moins

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

Afficher Plus de réponses

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

4 réponses

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. Moins

Afficher Plus de réponses

### Probability, conventional machine learning, deep learning, coding/algorithm, behavioral

3 réponses

I was good with most of the questions

Can you share how coding round was? what type of questions were asked?

Can you share what they asked in the coding round?

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

3 réponses

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). Moins

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

what is the question

### Why does one use MSE as a measure of quality. What is the scientific/mathematical reason for the same?

3 réponses

Mean-Square error is an error metric for measuring image or video quality it is popular video and image quality metric because the analysis and mathematics is easier with this L2-Norm metric. Most video and image quality experts will agree that MSE is not a very good measure of perceptual video and image quality. Moins

The mathematical reasoning behind the MSE is as follows: For any real applications, noise in the readings or the labels is inevitable. We generally assume this noise follows Gaussian distribution and this holds perfectly well for most of the real applications. Considering 'e' follows gaussian distribution in y=f(x) + e and calculating the MLE, we get MSE which is also L2 distance. Note: Assuming some other noise distribution may lead to other MLE estimate which will not be MSE. Moins

MSE is used for understanding the weight of the errors in any model. This helps us understand model accuracy in a way that is helpful when choosing different types of models. Check out more answers on InterviewQuery.com Moins

### How do you weight 9 marbles three times on a balance scale to select the heaviest one.

3 réponses

Do they all have the same weight except for one?

I think the question is the rest of the 8 balls are the same weight. In that case you can find the heaviest in 2 tries. Moins

First weight 4 vs 4. If they're the same =&gt; the last one is the haviest. If not, weight 2 vs 2 of the haviest 4. Then weights 1 vs 1 of the haviest 2. Moins

### Please code up and send me a function that takes two integer arrays and returns their intersection. This answer must take less than n^2 time.

3 réponses

Use a hash table or tree.

modify merge sort

sample outline of O(n log n) algorithm : a.sort(); b.sort(); list c={}; int i1=0,i2=0; while(true) { if(i1==n || i2==n) break; if(a[i1]==b[i2]) { c.insert(a[i1]); i1++; i2++; }else { if(a[i1] &lt; b[i2]) i1++; else i2++; } } return c; Moins

1 - 10 sur 3 502 Questions d'entretien

## Consultez les questions posées en entretiens pour des emplois similaires

machine learning engineerdata scientist internsoftware engineer interndata science intern