Orphic Medicare Interview Questions and Answers

Two easy questions two wasy questions two easy questions two easy questions

Q1. Technical interviews was very easy techijcal interviews was very easy very easy very easy
Add your answer
Q2. Interviews was conducted in advance of a news conference in the United Kingdom and the European government on Tuesday
Add your answer

Q1. What is current role like
Add your answer
Q2. How much experience do you have
Add your answer
Q3. What is your line of work all about
Add your answer

Q1. How much was your target
Add your answer
Q2. What was your target audience
Add your answer
Q3. What were the technical intricacies of your work
Add your answer

Q1. What is your salary expectation
Add your answer
Q2. Discussion on JD and roles and responsibilities
Add your answer
Q3. Discussion on company policies
Add your answer
Q4. Discussion on the DoJ
Add your answer

2 rounds of 15 min each
1st was probability and statistics
2nd was data science

A problem statement was given to build a predictive model to help a CFO of an IT company to predict the time taken by an issue to resolve and classify the issue to high and low priority. Give some insights on the dataset to reduce the time to resolve the issue

Q1. What is onehotencoding?
Add your answer
Q2. What do you mean by cross validation?
Add your answer
Q3. Explain Random Forest Classifier.
Add your answer
Q4. What are API and restful API?
Add your answer

Estimate the market size for a babysitter company across India? How will you proceed to expand the company across India?

Focus on basics ..what you have applied for ...for associate position.

Q1. Share details of your previous job.
Add your answer
Q2. Why are you looking for a change?
Add your answer
Q3. Why should we hire you?
Add your answer
Q4. What are your strengths and weaknesses?
Add your answer
Q5. Tell me about yourself.
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

The online test was scheduled on 10:00 AM. Total 304 students were eligible who appeared for the test. 93 students were shortlisted in this round. MCQs were asked and two coding question

MCQs were of medium to hard level.
OOPS(2 Question)
DBMS(2 questions)
Networking(2 Questions)
Operating System(2 Questions),
Aptitude(2 Questions)

Q1. Maximum Subarray Sum
You are given an array (ARR) of length N, consisting of integers. You have to find the sum of the subarray (including empty subarray) having maximum sum among all subarrays.
A subarr...read more
Ans. 
A subarray is a contiguous segment of an array. In other words, a subarray can be formed by removing 0 or more integers from the beginning, and 0 or more integers from the end of an array. I used Kadane's algorithm to solve it optimally. 
Answered Anonymously
Add your answer
Q2. Flipping Coins
Gary has N coins placed in a straight line. Some coins have head side up, and others have the tail side up.
Convention:
1 denotes the HEAD side is up. 
0 denotes the TAIL side is up. 
N...read more
Ans. Brute force
1. The idea is to check every subarray.
2. We can count the number of heads and number tails in every subarray and then calculate the maximum number of heads side up we can obtain if we flip that particular subarray.
3. We also keep a count of the final start index and final end index that will give us the number of heads side up we can obtain later.
Space Complexity: O(1)Explanation:
O(1).
 
In the worst case, only ...read more
Answered Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was technical interview round, which was purely based on coding followed by 1 SQL query. Duration of round was of 1 hour from 10 AM-11AM. Interviewer asked me 2 Coding questions one to solve and run on Hackerrank codepair platform and for another one she asked only my approach to solve problem. In the remaining last 10 minutes interviewer asked me 1 SQL query on JOIN. Total 28 students were shortlisted in this round.

Q1. First Missing Positive
You are given an array 'ARR' of integers of length N. Your task is to find the first missing positive integer in linear time and constant space. In other words, find the lowe...read more
Ans. 
I gave him the optimized solution.
Answered Anonymously
Add your answer
Q2. Kth missing element
Given an increasing sequence 'VEC', find the 'Kth' missing contiguous element in the given sequence starting from the leftmost element of the array.
Example :
Given &...read more
Ans. 
I told the solving approach by using max heap in O(NlogK) time complexity.
Answered Anonymously
Add your answer