# 4K

Sollicitatievragen voor Machine Learning Specialist gedeeld door sollicitanten

## Meest gestelde sollicitatievragen

Sorteren: Relevantie|Populair|Datum
Er werd een Machine Learning Software Engineer gevraagd...21 januari 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 antwoorden

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

Awesome!!

Meer reacties weergeven

6 antwoorden

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

Meer reacties weergeven

### Did you implement text analytics?

5 antwoorden

Yes

No

Yes

Meer reacties weergeven

### The three data structure questions are: 1. the difference between linked list and array; 2. the difference between stack and queue; 3. describe hash table.

4 antwoorden

Arrays are more efficient for accessing elements , while linked list are better for inserting or deleting elements, the choice between the two data structure depends on the specific requirements of the problem being solved. Minder

Stack and queues have different order of processing, operations for adding and removing elements, and usage scenarios.The choice between the two data structure depends on the specific requirements of the problem being solved Minder

A hash table is a data structure that allows for efficient insertion, deletion, and lookup of key-value pairs. It is based on the idea of hashing, which involves mapping each key to a specific index in an array using a hash function. The hash function takes a key as input and returns a unique index in the array. In order to handle collisions (when two or more keys map to the same index), some form of collision resolution mechanism is used, such as separate chaining or open addressing. In separate chaining, each index in the array is a linked list, and each key-value pair is stored in a node in the corresponding linked list. When a collision occurs, the new key-value pair is added to the end of the linked list at the corresponding index. In open addressing, when a collision occurs, a different index in the array is searched for to store the new key-value pair. There are several techniques for open addressing, such as linear probing, quadratic probing, and double hashing. Hash tables have an average case time complexity of O(1) for insertion, deletion, and lookup operations, making them a highly efficient data structure for many applications, such as database indexing, caching, and compiler symbol tables. However, their worst-case time complexity can be as bad as O(n) in rare cases, such as when there are many collisions and the hash table needs to be resized. Minder

Meer reacties weergeven

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

4 antwoorden

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

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

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

Meer reacties weergeven

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

4 antwoorden

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

Meer reacties weergeven

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

3 antwoorden

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

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

what is the question

### Design round: Design an api rate limiter Coding round: simple manipulation of arrays and maps Craft round: Design an ML Labelling system

3 antwoorden

There will be many documents in a document database. The labelling system must use machine learning to label into different categories. Eg help desk, system document, technical. There will a small train dataset available but not entirely reliable. Minder

The correct answer would be to use a combination of weak learning methods and gradually incorporate feedback and make it stronger Minder

APi rate limiter was really simple, just look at uber/ratelimit on git and thats it. Rest was farily easy Minder

### 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 antwoorden

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

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) Minder

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

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

3 antwoorden

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

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

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 Minder

Weergave: 1 - 10 van 4.231 sollicitatievragen