Machine Learning Software Engineer was asked...22 January 2010

↳

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

↳

Awesome!!

↳

The answer is already popular in computer vision fields!! It is called integral imaging. See this page http://en.wikipedia.org/wiki/Haar-like_features Less

Machine Learning Engineer was asked...20 April 2018

↳

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

Machine Learning Engineer was asked...12 March 2019

Data Scientist & Machine Learning was asked...19 October 2013

↳

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

↳

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 Less

↳

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

Machine Learning Engineer was asked...3 November 2020

↳

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

↳

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

↳

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

Machine Learning Engineer was asked...2 October 2019

↳

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

Machine Learning Engineer was asked...20 February 2022

↳

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

↳

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

↳

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

Principal Machine Learning Engineer was asked...8 March 2022

↳

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

↳

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

↳

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

Machine Learning Engineer was asked...17 July 2018

↳

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

↳

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

↳

what is the question

↳

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

↳

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

↳

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 Less