Shivam Medisoft Services Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Medium

This test consisted of 10 questions with no negative marking to test my problem solving ability.

Round duration - 60 minutes
Round difficulty - Medium

Technical Interview round with questions based on DSA and algorithms.

Q1. 
Word Distance Calculation
Given a document represented as an array/list ARR of words with length N, find the smallest distance between two given words for multiple queries. The distance is defined as the ...read more
Ans. 
Find the smallest distance between two words in a document for multiple queries.
• Iterate through the document to find the indices of the given words in the document array.

• Calculate the distance between the two indices for each query.

• Return the smallest distance or 'N' if a word from the query is not present in the document.
Answered by AI
Add your answer
Q2. 
Sudoku Solver Problem Statement
Given a 9 x 9 2D matrix 'MATRIX', where some cells are filled with digits (1-9) and others are empty (denoted by 0), determine if there is a way to fill the empty cells suc...read more
Ans. 
The task is to determine if a given 9x9 Sudoku puzzle can be solved.
• Check if each row, column, and 3x3 subgrid contains all numbers from 1 to 9 without repetition.

• Iterate through each empty cell and try filling it with a valid number, then recursively check if the puzzle can be solved.

• If all empty cells are filled without violating Sudoku rules, output 'yes'; otherwise, output 'no'.
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

You will be having 2 or 3 members per panel and questions may be from databases , object oriented programming, operating systems, Linux commands and algorithm may be asked for problems

Q1. 
Cycle Detection in a Singly Linked List
Determine if a given singly linked list of integers forms a cycle or not.
A cycle in a linked list occurs when a node's next points back to a previous node in the ...read more
Ans. 
Detect if a singly linked list forms a cycle by checking if a node's next points back to a previous node.
• Traverse the linked list using two pointers, one moving at double the speed of the other

• If the two pointers meet at any point, there is a cycle in the linked list

• If one of the pointers reaches the end of the list (null), there is no cycle
Answered by AI
Add your answer
Q2. 
Level Order Traversal Problem Statement
Given a binary tree of integers, return the level order traversal of the binary tree.
Input:
The first line contains an integer 'T', representing the number of te...read more
Ans. 
The task is to implement a function that returns the level order traversal of a binary tree given in level order.
• Create a queue to store nodes for level order traversal

• Start with the root node and enqueue it

• While the queue is not empty, dequeue a node, print its value, and enqueue its children

• Repeat until all nodes are traversed
Answered by AI
Add your answer
Q3. What are virtual functions?
Ans. 
Virtual functions are functions in a base class that are overridden in derived classes, allowing for polymorphic behavior.
• Virtual functions are declared in a base class with the 'virtual' keyword.

• They are meant to be overridden in derived classes to provide specific implementations.

• They allow for polymorphism, where a pointer to a base class can call a derived class's overridden function.

• Example: virtual void display()
Answered by AI
Add your answer