Modernizing Medicine Software Engineer Intern Interview Questions and Answers

Coding questions were easy and aptitude questions were a bit hard

Q1. Binary search based on 2 eggs
Add your answer
Q2. Two candles which were of random size, and what is the time to burn one candle completely
Ans. 
The time to burn one candle completely depends on the size of the candles and the rate at which they burn.
• The time to burn one candle completely is directly proportional to the size of the candle.

• The rate at which a candle burns can vary based on factors like the material of the candle, the wick, and the environment.

• For example, a larger candle may take longer to burn completely compared to a smaller candle, even if th
Answered by AI
Add your answer

2 Coding Questions, first was easy, second was medium

Q1. A question on trie data structure
Add your answer
Q2. Another DSA based question
Add your answer

One easy and one medium question(Java)

Q1. Basic java and oops question
Add your answer

It was a 4 hour hacker rank with 2 Long questions

Q1. It was a technical interview with a senior software engineer. The Question was about partitioning a string into lowercase letters, uppercase letters and numbers
Add your answer

The technical assessment was in hackerRank when I was assigned a coding problem and five questions chose which one is right type, two were in time complexity, and three in abstract reasoning, the coding problem I found to be very difficult, and couldn't make any progress on it.

Machine learning take-home assignment in Kaggle.

Q1. Question based on arrays, leetcode medium
Add your answer

There was 2 ques in OA round. One question out which i solved by using dp here OA focus mainly over graph and dp

Q1. Minimum element in stack in O(1) space
Ans. 
To find the minimum element in a stack in O(1) space, use an auxiliary stack to keep track of the minimum element at each step.
• Create an auxiliary stack to store the minimum element at each step.

• When pushing an element onto the main stack, compare it with the top element of the auxiliary stack and push the smaller one onto the auxiliary stack.

• When popping an element from the main stack, also pop the top element from th...read more
Answered by AI
Add your answer
Q2. What is segmentation fault and write the code to show this
Ans. 
A segmentation fault occurs when a program tries to access a memory location that it is not allowed to access.
• Segmentation faults commonly occur due to accessing an uninitialized pointer or accessing an array out of bounds.

• Here is an example code that causes a segmentation fault: int main() { int* ptr; *ptr = 10; return 0; }
Answered by AI
Add your answer
Q3. Balanced parenthesis and have to do all permutation of it and store it in vector and return this vector
Ans. 
Generate all permutations of balanced parentheses and store them in a vector.
• Use backtracking to generate all possible combinations of parentheses

• Check for balanced parentheses using a stack

• Store each valid combination in a vector

• Return the vector of permutations
Answered by AI
Add your answer