Meditab Software Medical Representative Interview Questions and Answers

Q1. Basic introduction
Add your answer

Q1. Questions about medical billing experience, what codes were billed and what were the rejections and denials and what steps were taken to fix that
Add your answer

Q1. Basic manual testing questions, Risk based tetsing, Alpha, beta, Test cases on any product
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

10 Aptitude questions with difficulty level hard were asked in this test.

Q1. What is the minimum number of planes required to go around the world?
Ans. 
The minimum number of planes required to go around the world is one.
• One plane can fly around the world without needing to stop.

• The plane can refuel mid-air or carry enough fuel for the entire journey.

• Examples: Non-stop flights like the Boeing 787 Dreamliner or Airbus A350 can circumnavigate the globe with one plane.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on data structures and algorithms. Questions about previous projects done and my roles on it and my leadership capabilities. Few technical questions from Threads and multi-processing.

Q1. 
Search in a Row-wise and Column-wise Sorted Matrix Problem Statement
You are given an N * N matrix of integers where each row and each column is sorted in increasing order. Your task is to find the positi...read more
Ans. 
Given a sorted N * N matrix, find the position of a target integer 'X'.
• Start from the top-right corner of the matrix and compare the target with the element at that position.

• Based on the comparison, move left or down in the matrix to narrow down the search.

• Repeat the process until the target is found or the search goes out of bounds.

• Return the position of the target if found, else return {-1, -1}.
Answered by AI
Add your answer
Q2. 
Rectangular Numbers Problem Statement
Ninja has a number 'N'. Your task is to generate a pattern where the outer rectangle is filled with the number 'N', and as you move inward, the numbers decrease conse...read more
Ans. 
Generate a pattern with outer rectangle filled with number 'N' and decreasing consecutively inward.
• Start by filling the outermost rectangle with the number 'N'.

• Decrease the numbers consecutively as you move inward towards the center.

• Continue this pattern until you reach the center of the rectangle.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

DSA based questions were asked in this round. Questions on implementation of Linux directory structure were also asked.

Q1. 
Binary Array Sorting Problem Statement
You are provided with a binary array, i.e., an array containing only 0s and 1s. Your task is to sort this binary array and return it after sorting.
Input:
 The fir...read more
Ans. 
Yes, the binary array sorting problem can be solved in linear time and constant space using a single traversal.
• Use two pointers approach to swap 0s to the left and 1s to the right.

• Maintain two pointers, one for 0s and one for 1s, and swap elements accordingly.

• Example: Input: [1, 0, 1, 0, 1], Output: [0, 0, 1, 1, 1]
Answered by AI
Add your answer
Q2. 
Next Greater Element Problem Statement
You are given an array arr of length N. For each element in the array, find the next greater element (NGE) that appears to the right. If there is no such greater ele...read more
Ans. 
The task is to find the next greater element for each element in an array to its right, if no greater element exists, return -1.
• Iterate through the array from right to left and use a stack to keep track of elements.

• Pop elements from the stack until a greater element is found or the stack is empty.

• Store the next greater element for each element in the output array.
Answered by AI
Add your answer
Q3. What is the difference between Binary Search Trees (BST) and Tries?
Ans. 
BST is a binary tree structure where each node has at most two children, while Tries are tree structures used for storing strings.
• BST is used for searching, inserting, and deleting elements in a sorted manner.

• Tries are used for storing and searching strings efficiently.

• BST has a hierarchical structure with left and right child nodes.

• Tries have nodes representing characters, forming a tree-like structure for strings.

• Exa...read more
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round. Questions about previous projects and current one were asked. I was also asked about aptitude problems from the first round and how I understood and approached towards solution?

Q1. 
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Ans. 
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
• Use backtracking algorithm to explore all possible configurations.

• Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

• Generate valid configurations recursively and backtrack when a solution is not possible.
Answered by AI
Add your answer
Q2. 
Form a Triangle Problem Statement
You are provided with an integer array/list ARR of length N. Your task is to determine if it is possible to construct at least one non-degenerate triangle using the value...read more
Ans. 
Check if it is possible to form a non-degenerate triangle using the sides provided in the array.
• Check if the sum of any two sides is greater than the third side for all combinations.

• If any such combination exists, return true; otherwise, return false.

• Handle multiple test cases as per the constraints provided.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

Behavioral questions and team skills were discussed in this round.

Round duration - 60 minutes
Round difficulty - Medium

This was a test round where 10 aptitude based questions were to be solved in 60 minutes

Q1. You have 5 pirates and 100 gold coins. The challenge is to determine how the pirates will divide the coins among themselves based on their ranking and the rules they follow.
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

They took us to the lab for this on and we were each given a paper with a program on it. It was all mixed as in each person got a different paper, You have around an hour to finish coding. after which you have to explain your code. They also gave wrong or incorrect inputs and see how your code handles these exceptions.

Q1. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. 
Reverse a given string containing alphabets, numbers, and special characters.
• Iterate through the string from the end to the beginning and append each character to a new string.

• Use built-in functions like reverse() or StringBuilder in languages like Python or Java for efficient reversal.

• Handle special characters and numbers along with alphabets while reversing the string.

• Ensure to consider the constraints provided in th...read more
Answered by AI
Add your answer
Q2. 
K Largest Elements Problem Statement
Given an unsorted array containing 'N' integers, you are required to find 'K' largest elements from the array and return them in non-decreasing order.
Input:
The fir...read more
Ans. 
Implement a function to find K largest elements in an unsorted array in non-decreasing order.
• Create a min heap of size K and insert the first K elements of the array

• For each remaining element, if it is larger than the root of the heap, replace the root with the element and heapify

• Finally, the heap will contain the K largest elements in non-decreasing order
Answered by AI
Add your answer
Q3. 
Remove Character from String Problem Statement
Given a string str and a character 'X', develop a function to eliminate all instances of 'X' from str and return the resulting string.
Input:
The first lin...read more
Ans. 
Develop a function to remove all instances of a given character from a string.
• Iterate through the string and build a new string excluding the specified character.

• Use a StringBuilder or similar data structure for efficient string manipulation.

• Handle edge cases like empty string or character not found in the input string.

• Ensure the function completes within the given time constraint.
Answered by AI
Add your answer
Q4. 
Triangle of Numbers Pattern
Ninja is tasked with printing a triangle pattern based on a given number 'N' for any test case.
Example:
Input:
N = 4
Output:
   1
  232
 34545
4567654
Explanation:
The pat...read more
Ans. 
Print a triangle pattern of numbers based on a given number 'N'.
• Iterate through each row and column to determine the numbers to print

• Use a combination of spaces and numbers to align the pattern correctly

• Increment the numbers in each row based on the row number
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Compared to the other round this is more tech oriented. Lot more tech questions. It is of normal difficulty and is not that hard to clear, you only need to know the basics.
Very basic of Data Structure and Oracle knowledge enough. Lots of simple questions from data structures(insert into heaps etc). They did not ask to write code for DS, but rather to explain the logic through diagrams. For some complicated question, they expect how much you brainstorm ideas in solving

Q1. 
Convert Binary Tree to Mirror Tree
Convert a given binary tree into its mirror tree, where the left and right children of all non-leaf nodes are interchanged.
Input:
An integer ‘T’ denoting the number o...read more
Ans. 
Convert a binary tree into its mirror tree by interchanging left and right children of non-leaf nodes.
• Traverse the tree in postorder fashion and swap the left and right children of each node.

• Use recursion to solve the problem efficiently.

• Modify the binary tree in place without creating a new tree.
Answered by AI
Add your answer
Q2. 
Heap Sort Problem Statement
Given an array ARR consisting of N integers, your task is to use the Heap sort algorithm to arrange the array in non-decreasing order.
Input:
The first line of the input cont...read more
Ans. 
Implement the Heap sort algorithm to arrange an array in non-decreasing order.
• Implement the Heap sort algorithm to sort the given array in non-decreasing order

• Use a max heap to sort the array in non-decreasing order

• Time complexity of Heap sort is O(n log n)
Answered by AI
Add your answer
Q3. What is indexing in the context of databases?
Ans. 
Indexing in databases is a technique used to improve the speed of data retrieval by creating a data structure that allows for quick lookups.
• Indexes are created on specific columns in a database table to speed up queries that search for data in those columns.

• Indexes work similar to the index of a book, allowing the database to quickly locate the desired data without having to scan the entire table.

• Examples of indexes in...read more
Answered by AI
Add your answer
Q4. Which data structure is better for your use case: a B Tree or a Hash Table?
Ans. 
Hash Table is better for fast lookups and insertions, while B Tree is better for range queries and ordered traversal.
• Use Hash Table for fast lookups and insertions with O(1) average time complexity.

• Use B Tree for range queries and ordered traversal with O(log n) time complexity.

• Consider the size of the dataset and the specific operations needed to determine the best data structure.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This round lasted for around 30 minutes. It more of a character analysis round with a lot of HR type questions.

Round duration - 90 minutes
Round difficulty - Medium

This round had 3 coding questions of Medium to Hard level of difficulty.

Q1. 
Balanced Parentheses Combinations
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.
Explanati...read more
Ans. 
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.
Answered by AI
Add your answer
Q2. 
Trapping Rain Water Problem Statement
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...read more
Ans. 
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.
Answered by AI
Add your answer
Q3. 
Rotting Oranges Problem Statement
You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:
• 0 - representing an empty cell
• 1 - representing a fre...read more
Ans. 
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...read more
Answered by AI
Add your answer

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.

Q1. 
Queue Using Stacks Implementation
Design a queue data structure following the FIFO (First In First Out) principle using only stack instances.
Explanation:
Your task is to complete predefined functions t...read more
Ans. 
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...read more
Answered by AI
Add your answer
Q2. 
Merge Intervals Problem Statement
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...read more
Ans. 
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.
Answered by AI
Add your answer
Q3. You have a 3-liter jar and a 5-liter jar. How can you measure exactly 4 liters using these two jars?
Add your answer

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.

Q1. 
Binary Tree Diameter Problem Statement
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...read more
Ans. 
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
Answered by AI
Add your answer
Q2. 
Power of 2 Problem Statement
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.
Input:
The fir...read more
Ans. 
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.
Answered by AI
Add your answer
Q3. What are some advantages of using Object-Oriented Programming (OOP)?
Ans. 
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...read more
Answered by AI
Add your answer
Q4. What are access specifiers and what is their significance in Object-Oriented Programming?
Ans. 
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
Answered by AI
Add your answer

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.

Q1. Why should we hire you?
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

The interviewer was really cool. He realized that I mostly work on java applications so he chose to ask me stuff related to that. He didn't want me to know the answer well but just wanted me to approach to it, maybe think more. He went through my resume back and forth and asked mostly about all my projects and their logic and how could I take them to the next level.
Tips: Be confident. Its okay not to know any answer, just try giving it a shot in the approach.

Q1. What is the difference between an abstract class and an interface in Java?
Ans. 
Abstract class can have both abstract and non-abstract methods, while interface can only have abstract methods.
• Abstract class can have constructors, member variables, and methods with implementation.

• Interface can only have abstract methods and constants.

• A class can implement multiple interfaces but can only extend one abstract class.

• Example: Abstract class - Animal with abstract method 'eat', Interface - Flyable with m
Answered by AI
Add your answer
Q2. What is the difference between 'final', 'finally', and 'finalize' in Java?
Ans. 
final is a keyword used to declare constants, finally is a block used in exception handling, and finalize is a method used for cleanup.
• final is a keyword used to declare constants in Java, meaning the value cannot be changed once assigned. Example: final int x = 10;

• finally is a block used in exception handling to ensure a piece of code is always executed, whether an exception is thrown or not. Example: try { // code } ...read more
Answered by AI
Add your answer
Q3. What is the difference between the private and final access modifiers in Java?
Ans. 
Private restricts access to the class itself, while final prevents inheritance and method overriding.
• Private access modifier restricts access to the class itself, while final access modifier prevents inheritance and method overriding.

• Private members are only accessible within the same class, while final classes cannot be extended and final methods cannot be overridden.

• Example: private int num; - num can only be accesse...read more
Answered by AI
Add your answer
Q4. What are the steps for establishing a JDBC connection?
Ans. 
Establishing a JDBC connection involves loading the driver, creating a connection, creating a statement, executing queries, and handling exceptions.
• Load the JDBC driver using Class.forName() method

• Create a connection using DriverManager.getConnection() method

• Create a statement using connection.createStatement() method

• Execute queries using statement.executeQuery() method

• Handle exceptions using try-catch blocks
Answered by AI
Add your answer
Q5. What is JSON?
Ans. 
JSON is a lightweight data interchange format used to store and transmit data between a server and a web application.
• JSON stands for JavaScript Object Notation.

• It is easy for humans to read and write, and easy for machines to parse and generate.

• JSON is language-independent and can be used with any programming language.

• Example: {"name": "John", "age": 30}

• Example: [{"name": "Alice", "age": 25}, {"name": "Bob", "age": 35}
Answered by AI
Add your answer
Q6. What do you know about garbage collection in Java?
Ans. 
Garbage collection in Java is the process of automatically managing memory by deallocating objects that are no longer needed.
• Garbage collection helps in preventing memory leaks by reclaiming memory used by objects that are no longer referenced.

• Java uses a garbage collector to automatically manage memory, unlike languages like C++ where memory management is manual.

• Garbage collection in Java can be triggered by calling S...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

I wouldn't say it went great but it was fine. I did not think I would clear it as for most of the questions the interviewer seemed disappointed and wanted more out of me.