Indus Health Plus Intern Interview Questions and Answers for Freshers

Q1. CV related questions were asked
Add your answer
Q2. About the location. About the domains,
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

The first Round was held on Hackerrank and the questions were of medium difficulty based on Data Structures and Algorithms.
The time of test was 1:00 PM and it was of 45 minutes with 2 coding questions to be solved.

Q1. Merge Intervals
You are given N number of intervals, where each interval contains two integers denoting the start time and the end time for the interval.
The task is to merge all the overlapping interval...read more
Ans. 
I firstly sorted the intervals based on their second values and then I considered each interval if it overlaps with the previous one or not.
Time Complexity : O(nlogn)
Space complexity : O(n)
Answered by CodingNinjas
View 2 more answers
Q2. Josephus
‘N’ people are standing in a circle numbered from ‘1’ to ‘N’ in clockwise order. First, the person numbered 1 will proceed in a clockwise direction and will skip K-1 persons including itself and w...read more
Ans. 
Firstly I tried recursively to fix my position to every place and check if I am remaining till Last to survive. But the Interviewer asked me to do better, then I thought of this question as a circular Linked List where in each step length decreases by one. Then I derived Mathematical formula for the position to survive till last with :
Time Complexity : O(n)
Space Complexity : O(n)
Answered by CodingNinjas
View 2 more answers

Round duration - 75 minutes
Round difficulty - Medium

A google Doc was shared with us and we were supposed to write code there.
Use of IDEs was not allowed so we had to write correct code on Google Docs which was later checked by them through online IDEs.
The Interviewer were friendly and observative and helped us through code if we made some silly error.

Q1. Largest rectangle in a histogram
You have been given an array/list 'HEIGHTS' of length ‘N. 'HEIGHTS' represents the histogram and each element of 'HEIGHTS' represents the height of ...read more
Ans. 
Firstly I tried brute force considering all possible left and right pointer and checking what all rectangle areas we can get and taking maximumm from them.
But the interviewer wanted better time complexity than O(n*n)
So I used two arrays Left and right and kept check of next shorter rectangle index to the present one.
This had Time Complexity of O(n) and Space Complexity : O(n)
The interviewer was pleased with this approa
Answered by CodingNinjas
View 4 more answers
Q2. Boundary Traversal
You have been given a binary tree of integers. Your task is to print the boundary nodes of this binary tree in Anti-Clockwise direction starting from the root node.
NOTE:
The boundary ...read more
Ans. 
I made three functions as the order given in Problem statement and did the Traversals in the same way making sure to cover all the edge cases .
This is similar to Preorder/Postorder/Inorder type problems.
Time Complexity : O(n)
Answered by CodingNinjas
View 1 more answer

Round duration - 60 minutes
Round difficulty - Easy

The face to face round was held on Google Meet where initially interviewer asked a DS/Algo problem. Later the manager joined and asked about our resume projects in detail.
The time was 10:00 AM.

Q1.  Maximum Subarray Sum
Given an array of numbers, find the maximum sum of any contiguous subarray of the array.
For example, given the array [34, -50, 42, 14, -5, 86], the maximum sum would be 137, since ...read more
Ans. 
First I tried brute force approach with taking sum between all left top corner and bottom right corners rectangle formed .
This had time complexity of O(n^4).
Then I brought down the time complexity to O(n^3) by using Kadane's Algorithm and coded it on Docs Shared.
Answered by CodingNinjas
View 3 more answers
Q2. Search In Rotated Sorted Array
Aahad and Harshit always have fun by solving problems. Harshit took a sorted array and rotated it clockwise by an unknown amount. For example, he took a sorted array = [1, 2,...read more
Ans. 
Firstly I gave the solution of Linear Search but he asked to implement binary search with all corner cases .
So I implemented binary search for finding the number of rotations array has went through.
Answered by CodingNinjas
View 2 more answers

Round duration - 60 Minutes
Round difficulty - Medium

It was early in the morning from 8 am. It was a test from home itself. It was a conducted on HackerEarth and was of 60 minutes duration. 30 students were shortlisted. I was also shortlisted.

Q1. Word Break
You are given a list of “N” strings A. Your task is to check whether you can form a given target string using a combination of one or more strings of A.
Note :
You can use any string of A mult...read more
Ans. Brute Force
In this solution, we will try to generate all prefixes and If we want a prefix present in the string then we will recur for the remaining string. 
Steps:
1. Store all strings of A on the hash map.
2. Declare and call function wordBreakHelper which will take a single argument string.
wordBreakHelper(s):
1. Base case if the length of the string is 0 then return true.
2. Run a loop from i = 1 to the length of the string:
   • If ...read more
Answered by CodingNinjas
View 3 more answers
Q2. Break The Board
You’re given a board of length 'L' and width 'W'. Your task is to break this board into 'L' * 'W' smaller squares, such that the total cost involved in break...read more
Ans. Greedy Approach
This problem can be solved using the greedy approach. By greedy, we mean that we simply start cutting the board along every horizontal and vertical line. But this cutting needs to be in a specific manner. Let’s see how we can do this.
 
• Start by making an integer variable minCost and initialize it to 0.
• Now we talked about cutting the board in a specific manner. This specific manner will involve minim...read more
Answered by CodingNinjas
Add your answer

Round duration - 45 Minutes
Round difficulty - Hard

This round was scheduled around 12 pm. It was a virtual round with one interviewer who was a Cure.Fit employee. My resume was scanned and a brief introduction was asked. After that a question was put up which I had to find solution to and code it. In the end, I asked questions regarding the type of projects they work on etc. I was selected for the next round

Q1. Balanced Sequence After Replacement
You are given a string of length ‘N’ containing only the following characters: ‘[’, ‘{’, ‘(’, ‘)’, ‘}’, ‘]’. At some places, there is ‘X’ in place of any bracket. Your t...read more
Ans. Using Recursion
The idea is to use stack data structure and is pretty much similar to the algorithm where we check if the expression is balanced or not. 
 
We mainly have 3 conditions to fulfil i.e. 
1. Opening bracket.
2. Closing bracket.
3. Character ‘X’.
    
Algorithm:
• Initialise a stack, say s.
• We traverse the whole string such as,
1. If all the elements of the string are traversed, return true if the stack is empty. Ot...read more
Answered by CodingNinjas
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

As soon as the HR round got over. I was asked to sit for my next round. It was again a problem solving round along with Data Structure questions in the end. The interviewer was an employee of Cure.Fit and after a brief introduction, I was given a question. After solving it, I was asked questions on Hashmaps, their implementation, time complexities. Finally, I was selected :)

Q1. Pair with Given Sum in a Balanced BST
You are given the ‘root’ of a Balanced Binary Search Tree and an integer ‘target,’ you have to tell if there exists any pair of nodes such that the sum of their value ...read more
Ans. Checking For Every Node
The idea is to fix one node and try to find, if there exists, a node whose sum along with the fixed node is equal to the given ‘target’.
 
The steps are as follows:
• We will use a helper function ‘findTargetPairHelper’ to fix each node.
• ‘findTargetPairHelper’ takes ‘mainRoot,’ ‘curRoot’ and ‘target’ as input parameters, ‘mainRoot’ is the root of the given tree, ‘curRoot’ is the node we are fixing...read more
Answered by CodingNinjas
View 1 more answer

Round duration - 60 minutes
Round difficulty - Easy

Had to solve 2 easy coding problems. Could be solved in 25 minutes if you are well prepared with DS-Algo.

Q1.  Job Scheduling Problem
You are given a list of ‘N’ jobs which has to be performed. Each job is associated with a deadline and a profit if the job is completed before the deadline. Each job takes one unit ...read more
Ans. 
I used maxheap to keep track of max element  [(frequency, taskname),...] and queue to keep track of used elements [(time last used, (frequency, taskname)),...] I used t as current time. I removed max from heap, added max to result , updated the timestamp and pushed to queue each time Then I checked from queue if I could use it based on timestamp, if yes I pushed to heap and repeated above step again
Answered by CodingNinjas
View 2 more answers
Q2. Water flow
You are given a matrix 'A' having ‘N’ rows and ‘M’ columns. Each cell of the matrix represents the height of water placed in that cell. Water can flow only in four directions ( up, down,...read more
Ans. 
Hint: DFS on matrix
I had solved this problem before. Didn't require much thinking on the spot. Always prepare company archives.
Answered by CodingNinjas
View 2 more answers

Round duration - 40 minutes
Round difficulty - Medium

Questions on Computer science subjects like OS, DBMS, OOP

Q1. DBMS
What is virtual class in OOP? 
Questions on Data Abstractions and polymorphism
Ans. 
Tip 1 : Do not use bookish language
Tip 2 : Use examples
Tip 3 : Be to the point
Answered by CodingNinjas
Add your answer
Q2. Operating System
Questions on types of memories
Ans. 
Tip 1 : Do not use bookish language
Tip 2 : Use examples
Tip 3 : Be to the point
Answered by CodingNinjas
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

General Discussion on Resume, some in depth questions on a project of interviewer's choice.

Q1. System Design
Web development based questions, server-client questions and some questions on javascript.
Ans. 
Tip 1 : Do not use bookish language
Tip 2 : Use examples
Tip 3 : Be to the point
Answered by CodingNinjas
Add your answer