MedTourEasy Software Developer Interview Questions, Process, and Tips

Round duration - 125 minutes
Round difficulty - Easy

Platform for this round is Amcat. The First round have coding questions , we can write programs in any language . It was easy round.

Q1. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. Count Characters
Anagrams have a unique property: the counts of each distinct character present in both strings are the same. One way to check this is: 
1. Sort both strings, so that all the same characters come together
2. Then loop through both strings together and check each element in both strings one by one
3. If at any position, the characters are found to be different or if the lengths of the two strings are different, ...read more
Answered Anonymously
Add your answer
Q2. 
Decimal to Octal Conversion Problem Statement
Convert a given decimal number into its equivalent octal representation.
Explanation:
The octal number system is a base-8 system, meaning each digit ranges ...read more
Ans. Maths
• A necessary observation for octal numbers is that every digit will lie in the range 0 - 7.
• Create a variable sol to store the final octal representation of X and initialise sol to 0.
• So, to convert decimal numbers to octal numbers:
             1. Multiply previous sol value by 10, to add new remainder in the current step.
             2. Find the r...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This round was easy they basically ask about some important topics of computer science as well as related to our position for company.

Q1. What is the need for virtual memory?
Add your answer
Q2. 
Delete Middle Element from Stack
You are provided with a stack ARR of size 'N+1'. Your task is to delete the middlemost element so that the size of the resulting stack becomes 'N'.
Recall that a stack is...read more
Ans. Recursive approach
The idea is to use recursive calls. We first remove all items one by one, then we recur. After recursive calls, we push all items back except for the middle item.
 
1. We have an input stack as “INPUTSTACK”, ‘N’ denotes the number of elements in the stack.
2. We define a function "DELETEMIDDLE" that accepts, a stack of integers "STACK" and an integer “COUNT” (initially 0) as input parameters.
3. Now we define...read more
Answered Anonymously
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

It was in the morning . Its one to one conversation. Interviewer was good enough. He ask about me and what i know about their company. What were my objectives and many more.