Machine learning researcher sollicitatievragen
956
Sollicitatievragen voor Machine Learning Researcher gedeeld door sollicitantenMeest gestelde sollicitatievragen
Have you ever had your code formally verified?
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
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
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
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
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
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
How would you mitigate overfitting?
2 antwoorden↳
Dropout, Data augmentation
↳
add more data, dropout, data augmentation
If you had multiple job offers of comparable benefits and salary and work, what would be the aspect that of one company or another that would be your final deciding factor?
2 antwoorden↳
Where can I grow the most?
↳
People and People Culture. It's always about people.
What is happening at each point on this gradient descent plot?
2 antwoorden↳
Each point is moving closer toward the local minima...
↳
Gradient descent is a way to minimize the error function of your hypothesis(prediction) vs actual value while training your model. The idea is to minimize your parameters at every iteration so that predicted vs actual value has minimum distance. The best solution is the one that reaches to global minima and that's where you stop and apply your test dataset for prediction. Minder
Serialize and Deserialize BST
2 antwoorden↳
Use recursive to solve it.
↳
In these sorts of interviews you really need to drill down and understand what the interviewer is looking for. A good way to simulate a real interview experience is to do a mock with one of the Quora Machine Learning Engineer experts on Prepfully, rated super strongly on TrustPilot... prepfully.com/practice-interviews Minder