i
MedTourEasy
Filter interviews by
I applied via Campus Placement and was interviewed in May 2024. There were 2 interview rounds.
GOOD LEVEL QUESTION WERE ASKED
The normal distribution is a bell-shaped curve that represents the distribution of data in a population.
The normal distribution is symmetrical around the mean.
Approximately 68% of the data falls within one standard deviation of the mean, 95% within two standard deviations, and 99.7% within three standard deviations.
Examples of variables that follow a normal distribution include height, weight, and test scores.
I am passionate about using data to drive insights and make informed decisions.
I have a strong background in statistics and data analysis.
I enjoy problem-solving and finding patterns in data.
I am excited about the opportunity to apply my skills in a real-world setting.
I am eager to learn from experienced professionals in the field.
I have strong analytical skills, proficiency in data analysis tools, and experience in interpreting and presenting data.
Strong analytical skills
Proficiency in data analysis tools (e.g. Excel, SQL, Python)
Experience in interpreting and presenting data
Ability to work with large datasets
Knowledge of statistical analysis
I applied via Naukri.com and was interviewed in Feb 2024. There was 1 interview round.
I applied via Company Website and was interviewed in Jan 2024. There were 2 interview rounds.
Simple test was there aptitude and basic english and analytics
I am a data analyst with a strong background in statistics and data visualization.
Graduated with a degree in Statistics
Proficient in programming languages like Python and R
Experience in analyzing large datasets and creating data visualizations
Strong problem-solving skills and attention to detail
MedTourEasy interview questions for popular designations
I applied via LinkedIn and was interviewed in Jun 2022. There was 1 interview round.
I was interviewed in Jan 2021.
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.
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...
Determine if two strings are anagrams of each other by checking if they contain the same characters.
Create a character frequency map for both strings and compare them.
Sort both strings and compare if they are equal.
Use a hash set to store characters of one string and remove characters of the other string to check for anagrams.
Convert a given decimal number into its equivalent octal representation.
The octal number system is a base-8 system, meaning each digit ranges ...
Convert a decimal number to its octal representation.
Understand the concept of octal number system (base-8)
Divide the decimal number by 8 and store the remainders to get the octal representation
Handle the edge cases where the decimal number is 0 or 1
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.
Virtual memory allows the operating system to use hard disk space as additional RAM when physical memory is full.
Allows running more applications than physical memory can support
Enables efficient memory management by swapping data between RAM and disk
Improves system performance by reducing the need to constantly load and unload programs into physical memory
Helps prevent programs from crashing due to insufficient memory
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...
Implement a function to delete the middle element from a stack, reducing its size by 1.
Iterate through the stack to find the middle element based on the stack size.
Remove the middle element and shift the remaining elements accordingly to maintain the stack order.
Handle cases where the stack size is even or odd differently to determine the middle element.
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.
Tip 1 : Practice Aptitude Questions from IndiaBix
Tip 2 : Continue practice on online coding platforms and do participate in coding challenges.
Tip 3 : Keep revising your Computer Science fundamentals(OS, DBMS, Software Engineering principles).
Tip 4 : Also brush-up your aptitude skills.
Tip 1 : Add only what you know properly. don't add extra stuff just to add weight to your resume.
Tip 2 : First page of the resume must in tabular form and it must give complete information about you in very simple manner.
Tip 3 : Use professional Keywords in your resume.
Tip 4 : Highlight your Skills and Achievements. Put only those skills in which you are good like any question can be asked on any particular skill. Like how you will do this in this.
I was interviewed before Apr 2021.
Round duration - 90 minutes
Round difficulty - Medium
This round had 3 coding questions of Medium to Hard level of difficulty.
Given an integer N
representing the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.
Generate all possible combinations of balanced parentheses for a given number of pairs.
Use recursion to generate all possible combinations of balanced parentheses.
Keep track of the number of open and close parentheses used in each combination.
Return the valid combinations as an array of strings.
You are given a long type array/list ARR
of size N
, representing an elevation map. The value ARR[i]
denotes the elevation of the ith
bar. Your task is to determine th...
Calculate the total amount of rainwater that can be trapped between given elevations in an array.
Iterate through the array and calculate the maximum height on the left and right of each bar.
Calculate the amount of water that can be trapped at each bar by taking the minimum of the maximum heights on the left and right.
Sum up the trapped water at each bar to get the total trapped water for the entire array.
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
Find the minimum time required to rot all fresh oranges adjacent to rotten oranges.
Create a queue to store the coordinates of rotten oranges and perform BFS to rot adjacent fresh oranges.
Track the time taken to rot all fresh oranges and return -1 if not all fresh oranges can be rotten.
Update the grid with the new state of oranges after each second.
Handle edge cases such as empty grid or no fresh oranges present.
Example...
Round duration - 60 Minutes
Round difficulty - Medium
This was a standard DS/Algo round where I was given 2 questions to solve under 60 minutes. I was able to come up with the optimal approach for both the questions and then at the end of the interview I was also asked the famous Die Hard Water Puzzle.
Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.
Your task is to complete predefined functions t...
Implement a queue using stacks following FIFO principle.
Use two stacks to simulate a queue.
For enQueue operation, push elements onto stack1.
For deQueue operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then pop from stack2.
For peek operation, if stack2 is empty, pop all elements from stack1 and push onto stack2, then return top of stack2.
For isEmpty operation, check if both stack1 and st...
You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.
Your task is to merge all overlapping intervals a...
Merge overlapping intervals and return sorted list of merged intervals by start time.
Sort the intervals based on start time.
Iterate through intervals and merge overlapping ones.
Return the merged intervals in sorted order.
Round duration - 60 Minutes
Round difficulty - Medium
This round had 2 coding questions - first one related to Binary Tree and the second one was a simple question from Bit Manipulation. This was followed by some questions from OOPS.
You are given a Binary Tree, and you need to determine the length of the diameter of the tree.
The diameter of a binary tree is the length of the longest path betwe...
The task is to find the diameter of a binary tree, which is the length of the longest path between any two end nodes in the tree.
Traverse the tree to find the longest path between two nodes.
Keep track of the maximum diameter found during traversal.
The diameter may not necessarily pass through the root node.
Consider both left and right subtrees while calculating the diameter.
Example: For input 1 2 3 4 -1 5 6 -1 7 -1 -1
Determine if it is possible to reorder the digits of a given integer 'N' such that the resulting number is a power of two. The leading digit must not be zero.
The fir...
The problem involves determining if it is possible to reorder the digits of a given integer to form a power of 2.
Iterate through all possible permutations of the digits of the given integer.
Check if any of the permutations form a power of 2.
Return 1 if a valid permutation is found, else return 0.
Advantages of OOP include code reusability, modularity, and easier maintenance.
Code reusability: Objects can be reused in different parts of the program, reducing redundancy.
Modularity: OOP allows for breaking down complex problems into smaller, more manageable parts.
Easier maintenance: Changes to one part of the codebase do not necessarily affect other parts, making maintenance easier.
Encapsulation: Data hiding and ab...
Access specifiers define the level of access to class members in Object-Oriented Programming.
Access specifiers include public, private, protected, and default
Public members are accessible from outside the class
Private members are only accessible within the class
Protected members are accessible within the class and its subclasses
Default access is when no access specifier is specified
Round duration - 30 Minutes
Round difficulty - Easy
This was my last round and I hoped it to go good just like the other rounds. The interviewer was very straight to point
and professional. The interview lasted for 30 minutes.
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Queue can be implemented using two stacks by maintaining the order of elements in the stacks.
Create two stacks, let's call them stack1 and stack2
When an element is enqueued, push it to stack1
When an element is dequeued, pop all elements from stack1 and push them to stack2
Pop the top element from stack2 and return it as the dequeued element
If stack2 is empty, repeat step 3
To get the front element of the queue, peek the
Left join returns all records from left table and matching records from right table. Full outer join returns all records from both tables.
Left join is used to combine two tables based on a common column.
In left join, all records from the left table are returned along with matching records from the right table.
If there is no match in the right table, NULL values are returned.
Example: SELECT * FROM table1 LEFT JOIN table...
Magic functions are special methods in PHP that start with __. Autoloading is a way to automatically load classes.
Magic functions are used to handle certain events in PHP, such as object creation or property access.
Autoloading allows PHP to automatically load classes when they are needed, without requiring manual includes.
Magic functions can be used in conjunction with autoloading to dynamically load classes or handle
Given three sorted arrays, find common elements.
Create three pointers to traverse each array
Compare the elements at the pointers and move the pointer of the smallest element
If all pointers point to the same element, add it to the result and move all pointers
Repeat until any pointer reaches the end of its array
Check if a number is a power of 2 or not.
A power of 2 has only one bit set in its binary representation.
Use bitwise AND operator to check if the number is a power of 2.
If n is a power of 2, then n & (n-1) will be 0.
Event bubbling is the propagation of an event from the innermost child element to the outermost parent element.
Events triggered on a child element will also trigger on its parent elements
The event travels up the DOM tree until it reaches the document object
Can be stopped using event.stopPropagation()
Can be useful for event delegation
The .on('click',function() is a more flexible method than .click(function())
The .on() method can handle multiple events and selectors
The .click() method can only handle one event and one selector
The .on() method can also handle dynamically added elements
The .click() method cannot handle dynamically added elements
Function to check if two strings are anagram or not
Create two character arrays from the strings
Sort the arrays
Compare the sorted arrays
Function to determine the order of integers in an array.
Check first and last element to determine if increasing or decreasing
Check for inflection point to determine if order changes
Return order type as string
Optimize images, minify code, reduce HTTP requests, use caching, and lazy loading.
Optimize images using compression and appropriate file formats
Minify code to reduce file size and improve load times
Reduce HTTP requests by combining files and using sprites
Use caching to store frequently accessed data locally
Implement lazy loading to defer loading of non-critical resources
Design a database schema for a movie site with user ratings and recommendations.
Create tables for movies, users, ratings, and recommendations
Use foreign keys to link tables
Include columns for movie genre and user watch history
Algorithm for recommendations can use user watch history and ratings to suggest similar movies
Function to simulate dice roll with equal probability without using random function
Use a toss function that returns either 0 or 1 with equal probability
Call the toss function 3 times and convert the result to a binary number
If the binary number is greater than 0 and less than or equal to 6, return it
If the binary number is greater than 6, repeat the process
Query to fetch duplicate email from table
Use GROUP BY and HAVING clause to filter out duplicates
SELECT email, COUNT(*) FROM table_name GROUP BY email HAVING COUNT(*) > 1;
This will return all the duplicate emails in the table
I applied via Campus Placement
based on 9 interviews
Interview experience
based on 91 reviews
Rating in categories
Data Analyst Trainee
52
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst Intern
19
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Analyst
14
salaries
| ₹0 L/yr - ₹0 L/yr |
Business Analyst
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Data Science Intern
8
salaries
| ₹0 L/yr - ₹0 L/yr |
Practo
Lybrate
Portea Medical
Clove Dental