Medpace Software Engineer Interview Questions and Answers for Freshers

Round duration - 90 minutes
Round difficulty - Easy

Q1.  Occurrence of Each Word
You are given a string S of words. Your task is to count the occurrence of each word present in the string S. A word is a sequence of one or more non-space characters, and there ca...read more
Ans. Brute Force
Steps:
 
• We iterate a given string, and while iterating the string, we maintain a temporary string word that stores the current word and then checks if we already count the word's occurrence previously by checking whether the word is present in the visited list.
• If the word is not present, then insert it in the visited list, and count the occurrences of the word in the rest of the string.
• Else, we simply sk...read more
Answered by CodingNinjas
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Q1. Anagram Pairs
Pre-requisites: Anagrams are defined as words or names that can be formed by rearranging letters of another word. Such as "spar" can be formed by rearranging letters of "rasp&q...read more
Ans. 
I did this question with the help of map.
I split the string on the basis of space and then counted the frequency of each word using map.
Answered by CodingNinjas
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Q1.  Palindromic Substrings
You have been given a string STR. Your task is to find the total number of palindromic substrings of STR.
Example :
If the input string is "abbc", then all the possible ...read more
Ans. Brute Force Approach
1. Initialize a count variable with 0 to keep track of the number of palindromic substrings.
2. Let n be the length of the input string. Run a double nested loop. The outer loop will go from i = 0 to i = n - 1, and the inner loop will go from j = i to j = n - 1. i and j denote the start and end indices of a substring in the input string.
3. Check whether the substring from index i to j forms a palindrome.
   • If it...read more
Answered by CodingNinjas
Add your answer
Q2. DBMS
Find 4th highest salary from the table.
Ans. 
Tip 1 : Do practice sql queries from leetcode.
Answered by CodingNinjas
Add your answer

Round duration - 150 minutes
Round difficulty - Medium

For MCQ Round, we have 2 rounds:- 
1. Logical Reasoning (Window of 4 hours)
2. Mathematical Reasoning(Window of 4 hours)
The environment was fine. They gave an option of attempting a mock test in order to familiarize us with the environment

Logical Reasoning, in which there were 12 questions, and for each question we had a time limit of 75 seconds. There was a cut-off of 40 for the next round, and people who qualified were sent an e-mail with a link to continue with the process.

Numerical Reasoning, in my opinion, was the most challenging round. The questions were in a pair of 3 in which a table/bank statement was given and 3 questions were based on that. The questions were purely based on calculations and semi-subjective. The time given for the 1st question was 90 seconds and for the rest 2 questions, 75 seconds each

For Coding Round, 
120 minutes window(Test was of 90 minutes)
We have two questions
For the first question(30 Minutes)
For the second question(60 Minutes)
The tricky thing was we only had one attempt, i.e we were allowed to submit the solution only once.

Q1. Maximum Frequency Number
Ninja is given an array of integers that contain numbers in random order. He needs to write a program to find and return the number which occurs the maximum times in the given inpu...read more
Ans. 
Step 1 : Make a Frequency array of size 26
Step 2 : Iterate on the string from left to right and increase the frequency of the character by one
Step 3 : Iterate on the Frequency array and find the max frequency and its corresponding character
Answered by CodingNinjas
Add your answer
Q2. Mike and Mobile
Mike is a little boy who loves solving math problems. One day he was playing with his mom’s mobile. The mobile keypad contains 12 buttons { 10 digits(0-9) and 2 characters(‘*’ and ‘#’) }. M...read more
Ans. 
Step 1 : We can solve this using recursion but it will be too slow
Step 2 : So to improve the complexity, we need to use memoization so that we will not recalculate the same step again and again
Step 3 : Recursion + Memoization = Dynamic Programming solution Passed all cases
Answered by CodingNinjas
Add your answer

Round duration - 40 minutes
Round difficulty - Medium

The timing was around 1 pm and the whole interview went for about 40 minutes.
The interviewer first went through my resume and asked me to introduce myself. After my introduction, he asked me about my projects mentioned in the resume. In the introduction itself, I told him that I am interested in competitive programming and preparing for ICPC. He then asked me about my preparation for ICPC. He then asked me some questions from OOPS. I was then asked 1 simple CP problem. The interviewer also asked about situation-based problems. As I previously mentioned about Competitive Programming, he asked how this will help in adding value to the company.

Q1. Remove Duplicates
Ninja is playing with numbers but hates when he gets duplicate numbers. Ninja is provided an array, and he wants to remove all duplicate elements and return the array, but he has to maint...read more
Ans. 
Step 1 : To mark the presence of an element size of the array, n is added to the index position arr[i] corresponding to array element arr[i].
Step 2 : Before adding n, check if the value at index arr[i] is greater than or equal to n or not. If it is greater than or equal to, then this means that element arr[i] is repeating.
Step 3 : To avoid printing repeating elements multiple times, check if it is the first repetition ...read more
Answered by CodingNinjas
Add your answer

Round duration - 10 minutes
Round difficulty - Easy

In this round interviewer basically asked about my project in detail and also asked about various technologies used in that project.

Q1. Puzzle
I told them that I have been doing competitive programming in C++, he asks why am I using only C++ and not any other language. I have done a project in python also so he asks me about the difficultie...read more
Ans. 
Tip 1 : Be confident
Tip 2 : Be thorough in the theory
Tip 3 : You should know about everything you have mentioned in the resume like what it does, how it works etc.
Answered by CodingNinjas
Add your answer

Round duration - 10 minutes
Round difficulty - Easy

We were asked about family background, location of the intern, any interest in startups (as they don’t want students who they hire also work with startups side by side), etc.

Q1. General Questions
1. Family background
2. Location of the intern
3. Any interest in startups (as they don’t want students who they hire also work with startups side by side)
4. Willingness to relocate
Ans. 
Tip 1 : Remain calm
Tip 2 : Interviewers often ask about your strengths and weaknesses, so be prepared for those
Tip 3 : Research the company
Tip 4 : Make sure your answers are consistent with what’s on your resume
Answered by CodingNinjas
Add your answer

The aptitude test is a bit different from everyone but its interesting. There are timed questions (instead of timed paper) and it judges you on all logical and reasoning thinking. Hold your nerves, youe gonna do great.

The coding test is solvable if you can do leet code problems.

Q1. The HR intereview was nice. She asked about likes dislikes, leadership qualities and situational question. Very positively taken interview.
Add your answer

Q1. It was a technicalround. Was asked questions on my project. Very approachable interviewer. Id suggest to answer calmly and just let them kjow if you dont know one.
Add your answer

Round duration - 30 Minutes
Round difficulty - Medium

This video call interview round was fairly based on the Resume. The interviewer went in detail about a couple of projects related to ML and Djikstra algorithm. The questions asked were very basic; based on the technology stack I used and why did I really choose it. He also asked me to present my screen and show the code I wrote for the project.

Q1. Dijkstra's shortest path
You have been given an undirected graph of ‘V’ vertices (labeled 0,1,..., V-1) and ‘E’ edges. Each edge connecting two nodes (‘X’,’Y’) will have a weight denoting the distance betw...read more
Ans. Using Adjacency Matrix
The idea is to maintain two arrays, one stores the visited nodes, and the other array stores the distance (element at index ‘i’ denotes the distance from node 0 to node ‘i’). We pick an unvisited minimum distance vertex, then update the distance of all its adjacent vertices considering the path from source to an adjacent vertex to pass through the picked minimum distance vertex. Repeat the process...read more
Answered by CodingNinjas
Add your answer

Round duration - 10 Minutes
Round difficulty - Easy

This was a typical round by HR. There were only 5 students shortlisted for this round so it wasn't an eliminator round. The straight strategy followed by HR was to understand why I have shifted to the IT field from Civil engineering and how keen I am to continue in this field and not exit later.

Q1. Basic HR Questions
Who is your role model?
What are your hobbies?
Add your answer