You have 52 playing cards (26 red, 26 black). You draw cards one by one. A red card pays you a dollar. A black one fines you a dollar. You can stop any time you want. Cards are not returned to the deck after being drawn. What is the expected payoff following this optimal rule? for this, u need to find what is the optimal stopping rule in terms of maximizing expected payoff.
Finding the shortest path without using some dangerous nodes
All interview questions were straight forward related to ML and AI and applications of that in the medical data field.
“I really want to get to know the real you,” and “What makes you stand out?"
Are you interviewing anywhere else, and where.
Behavioral questions without context
1) What is the data structure of a search engine 2) 2 Sum
They asked about my experience in terms of learning processes
Tell us about a challenging project you worked on
What are the algorithms you have worked on and based on the answer, they will ask you in detail.
Viewing 1181 - 1190 interview questions