Yahoo Machine Learning Engineer Interview Questions and Answers

Standard Leetcode Medium question.

Q1. DSA Questions and database questions.
Add your answer

Q1. What design tool can be implemented to determine if A and B are friends, and if B and C are friends, subsequently making A and C friends automatically?
Ans. 
A graph traversal algorithm like Depth First Search (DFS) can be implemented to determine if A and B are friends, and if B and C are friends, subsequently making A and C friends automatically.
• Implement a graph where each person is a node and friendships are edges between nodes

• Use Depth First Search (DFS) to traverse the graph and check for connections between A and B, and B and C

• If both connections exist, then A and C
Answered by AI
Add your answer

Required to write codes in python

Required to write codes in python

Q1. Time to tackle difficulties
Add your answer
Q2. Time to learn things outside school
Add your answer

Q1. Focus on algorithms - trees, graphs. Questions on improving algorithm performance. Converting algorithm to code.
Add your answer

Q1. Tell me about yourself
Add your answer

45 min round. Similar to Leetcode medium level question.

45 min coding round, 2 question asked

Q1. System design of proximity service
Ans. 
Design a system for proximity service
• Utilize geolocation data to track user locations

• Implement algorithms to calculate proximity between users

• Use real-time updates to notify users of nearby contacts
Answered by AI
Add your answer

Q1. Behavioral questions
Add your answer

Leetcode question on DFS and BFS. Passed

Develop a ml model to predict pass/no pass decision.

Implement boolean canConstruct(String targetString, String[] dict) which returns true if we can construct the targetString by concatenating the words given in the dictionary

Q1. Implement key value store
Ans. 
Implement a key value store for storing and retrieving data efficiently.
• Use a hash table or a balanced tree data structure to store key-value pairs.

• Implement functions for inserting, updating, deleting, and retrieving key-value pairs.

• Consider implementing features like transactions, concurrency control, and data persistence.

• Example: Implement a simple key value store using a hash table in Python.
Answered by AI
Add your answer