Medtech Intern Interview Questions and Answers

Very easy level, GD amond 20-21 people, where they just test your english

Q1. Asked about previous internships and ML algorithms
Add your answer
Q2. What is LLM? What is transfer learning?
Ans. 
LLM stands for Large Language Model. Transfer learning is a machine learning technique where a model trained on one task is repurposed for another task.
• LLM refers to large language models that are trained on vast amounts of text data to understand and generate human language.

• Transfer learning involves taking a pre-trained model and fine-tuning it on a new dataset or task to improve performance.

• For example, a model trai...read more
Answered by AI
Add your answer

Online assignment including natural tasks and policies

Better and perception

Q1. What is marketing and what are tools of marketing
Ans. 
Marketing is the process of promoting and selling products or services. Tools of marketing include advertising, public relations, and market research.
• Marketing involves identifying customer needs and wants, and creating products or services to meet those needs

• Marketing also involves promoting and selling those products or services through various channels

• Tools of marketing include advertising, public relations, sales p...read more
Answered by AI
Add your answer
Q2. To introduce yourself, and interests
Add your answer

Round duration - 90 minutes
Round difficulty - Easy

It was just after the first round in the morning

Q1. Huffman Coding
You are given an array 'ARR' of Integers having 'N' elements. The array contains an encoded message. For each index 'i', 'ARR[i]' denotes the frequency of the...read more
Ans. Optimized Solution
We will be dividing our solution into three parts for better understanding. We will use a Min-Heap to build a binary tree and then traverse the binary tree to assign Huffman codes to each element.
 
 
1. Understanding the need of using a Min-Heap 
A basic idea would be to sort the frequency array and repeatedly give the smallest not used code to the character having maximum frequency. This ide...read more
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

1 hr after the second round got over and results were announced in the morning.

Q1. Ways To Make Coin Change
You are given an infinite supply of coins of each of denominations D = {D0, D1, D2, D3, ...... Dn-1}. You need to figure out the total number of ways W, in which you can make a cha...read more
Ans. Recursion
 
1. The idea is to use recursion.
2. For a particular coin, we have two options either include it or exclude it.
3. If we include that coin, then calculate the remaining number that we have to generate so recur for that remaining number.
4. If we exclude that coin, then recur for the same amount that we have to make.
5. Our final answer would be the total number of ways either by including or excluding.
6. There will be two edg...read more
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

10 A.M in the morning.
The interviewers were very knowledgeable and humble

Q1. Unique Element In Sorted Array
Nobita wants to impress Shizuka by guessing her lucky number.
Shizuka gave Nobita a sorted list of ‘N’ numbers such that every number occurred twice in the list except Shiz...read more
Ans. 
Step 1 : I told them brute force approach.
Step 2 : Told about bitmasking approach.
Step 3 : I them them Binary Search approach(the most optiimsed one)
Step 4 : They told me to code it and run test cases.
Answered Anonymously
Add your answer
Q2. Print Nodes at Distance K From a Given Node
You are given an arbitrary binary tree, a node of the tree, and an integer 'K'. You need to find all such nodes which have a distance K from the given no...read more
Ans. 
Step 1 : I told them brute force approach.
Step 2 : Told them about Binary tree approach
Step 3 : They told me to code it and dry run and run test cases.
Answered Anonymously
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

It was after the first technical interview round.
Got a mail for the second interview round .
Timings approx 12 AM

Q1. Remove BST keys outside the given range
Given a Binary Search Tree (BST) and a range [min, max], remove all keys which are outside the given range. The modified tree should also be BST.
Input format:
Th...read more
Ans. 
Step 1 : Brute force array conversion approach.
Step 2 : Delete a node in a tree approach.
Step 3 : Optimised the above approach to delete only specified nodes to achieve the answer
Step 4 : Coded the approach and ran the test cases provided
Answered Anonymously
Add your answer
Q2. Inorder Sucessor
You have been given an arbitrary binary tree and a node of this tree. You need to find the inorder successor of this node in the tree.
The inorder successor of a node in a binary tree is...read more
Ans. Inorder Traversal
• The fact that all the data values are unique makes the solution look very intuitive.
• We can simply store the inorder traversal of the given tree in some data structure, most probably arrays, and find the element present after the given node in the array.
• For inorder traversal, we can write a simple recursion code, where for every node, its left subtree is visited recursively, and then the node is visited...read more
Answered Anonymously
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

Got a call from Hr after clearance of the first 2 rounds.
Timing were 5:30 P.M

It was so easy. Just a basic questions.

Was bit nervous but somehow managed to clear.

Q1. Why you choose this job?
Add your answer
Q2. Do you think you're really fit for this job?
Add your answer

Q1. Tell me about self
Add your answer
Q2. What do you know about our company
Add your answer
Q3. Why do you want this role
Add your answer
Q4. What is your greatest strength?
Add your answer
Q5. What is greatest weakness?
Ans. 
My greatest weakness is my tendency to take on too many tasks at once, leading to occasional overwhelm.
• Tendency to take on too many tasks at once

• Occasional overwhelm

• Working on prioritizing tasks and delegating when necessary
Answered by AI
Add your answer