AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Niramai Health Analytix Interview Questions and Answers
Niramai Health Analytix Interview Experiences
2 interviews found
Vikrant Attri
(2 Questions)
- Q1. How do you handle huge data in an API
- Ans.
Use pagination, caching, and efficient algorithms to handle large data in an API.
Implement pagination to limit the amount of data returned in each API call.
Use caching to store frequently accessed data and reduce the load on the database.
Optimize algorithms for data processing to improve performance.
Consider using asynchronous processing for time-consuming tasks.
Utilize compression techniques to reduce the size of data
- Q2. How do you handle huge load in the DB
- Ans.
I handle huge load in the DB by optimizing queries, indexing, partitioning data, and using caching techniques.
Optimize queries to reduce the load on the database server
Use indexing to speed up data retrieval
Partition data to distribute load across multiple servers
Implement caching techniques to reduce the number of queries to the database
Use sharding to horizontally scale the database
Skills evaluated in this interview
SDE Interview Questions asked at other Companies
Anonymous
Selected
I applied via Naukri.com and was interviewed before Oct 2022. There were 2 interview rounds.
(3 Questions)
- Q1. Introduce yourself Are u willing to do this job Are u willing to do over time Salary is low u r ok with it
- Q2. That's all I write as above like that only
- Q3. Are u ready to work over time
Interview Preparation Tips
Computer Operator Interview Questions asked at other Companies
Top trending discussions
Interview questions from similar companies
nerella saikrishna
Interview Questionnaire
12 Questions
- Q1. Insert a node in a Linked List, if a pointer to a node(it's not a head pointer) of Linked List is given.
- Q2. What is the Time Complexity of Binary Search and it's derivation
- Ans.
Binary Search has a time complexity of O(log n) and is derived from dividing the search space in half at each step.
Binary Search is a search algorithm that works on sorted arrays.
It starts by comparing the target value to the middle element of the array.
If the target value is smaller, the search continues on the lower half of the array.
If the target value is larger, the search continues on the upper half of the array.
T...
- Q3. Write code for QuickSort
- Ans.
QuickSort is a sorting algorithm that uses divide and conquer approach.
Choose a pivot element from the array
Partition the array into two sub-arrays, one with elements less than the pivot and one with elements greater than the pivot
Recursively apply the above steps to the sub-arrays
Combine the sorted sub-arrays to get the final sorted array
- Q4. Write code for Fibonacci Series using Recursion, Iteration and Dynamic Programming
- Ans.
Code for Fibonacci Series using Recursion, Iteration and Dynamic Programming
Recursion: Define a function that calls itself with the previous two numbers in the series as arguments
Iteration: Use a loop to calculate the series by adding the previous two numbers in each iteration
Dynamic Programming: Store the previous two numbers in variables and use them to calculate the next number in the series
- Q5. How to implement an operation with Stacks which will be similar to Queue
- Ans.
Implementing a Queue using Stacks
Use two stacks to implement a queue
Push elements onto the first stack
When dequeuing, pop all elements from the first stack and push onto the second stack
Pop the top element from the second stack to dequeue
If the second stack is empty, pop all elements from the first stack and push onto the second stack
- Q6. Write code for MergeSort
- Ans.
MergeSort is a divide and conquer algorithm that sorts an array of strings.
Divide the array into two halves
Recursively sort the two halves
Merge the sorted halves
- Q7. 2 types of detective ball puzzles
- Q8. 25 Horses, 5 Tracks, 3 Fastest Puzzle
- Q9. How the letters of a text are determined(Basically about OCR)
- Q10. Write code for Insertion Sort and Selection Sort and find their time complexities and also the cases where their usage is efficient
- Q11. Explain about Counting Sort
- Ans.
Counting Sort is a sorting algorithm that sorts elements by counting the number of occurrences of each unique element.
Count the occurrences of each element in the array
Calculate the cumulative sum of the counts
Place each element in the sorted array based on its count and cumulative sum
Time complexity is O(n+k) where n is the number of elements and k is the range of input
Example: Sort an array of strings based on their
- Q12. When we type a part of a word in chrome, how is it able to show all the types of words, which are consisted of that part
- Ans.
Chrome uses an algorithm to predict and suggest words based on user input.
Chrome's algorithm uses a combination of user history, bookmarks, and popular searches to predict and suggest words.
The algorithm also takes into account the frequency and recency of the user's input.
Chrome's suggestion feature is powered by Google's Autocomplete API, which uses machine learning to predict and suggest words.
The suggestions are di...
Interview Preparation Tips
Experience: First Question, at the start I was not able to answer and he gave me an hint(He asked me the insertion in an array). So, I got the idea for the insertion in Linked List and was able to answer it.
Remaining questions, I was able to answer confidently.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.
Round: Technical Interview
Experience: I was able to answer all the questions confidently, since I know the answers for them, But the last question was out of my scope and I explained based on my intuition and knowledge.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.
Round: Technical Interview
Experience: I have given the answers for 1&2 questions with clear explanation. And the third question is again out of my scope and I explained this also based intuition.
Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.
General Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.
Skill Tips: Take your own time in answering a question and be clear over your answer before telling about the code that you have written.
If you don't know an answer for some question, just keep telling him simple cases(which are valid), so that the interviewer will sometimes try to guide you through the solution.
Skills: Logical Puzzles, Algorithms And DataStructures
College Name: IIT Madras
Motivation: 1. Primary Reason: Passionate about Programming and Problem solving.
2. The profile is software Engineer.
3. You can see your idea, having an impact on the society which is possible with this type of company.
4. And a good package.
Funny Moments: Nothing Really...
Skills evaluated in this interview
I was interviewed before Apr 2021.
(3 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
Nrepresenting the number of pairs of parentheses, find all the possible combinations of balanced parentheses using the given number of pairs.Explanati...
- 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.
- Q2.
Trapping Rain Water Problem Statement
You are given a long type array/list
ARRof sizeN, representing an elevation map. The valueARR[i]denotes the elevation of theithbar. Your task is to determine th... - 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.
- 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...
- 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...
(3 Questions)
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...
- 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...
- 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...
- 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.
- Q3. You have a 3-liter jar and a 5-liter jar. How can you measure exactly 4 liters using these two jars?
(4 Questions)
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...
- 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
- 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... - 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.
- 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...
- 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
(1 Question)
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?
Interview Preparation Tips
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.
Skills evaluated in this interview
Interview Questionnaire
8 Questions
- Q1. Implement queue with the help of two stacks
- Ans.
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
- Q2. Iven a table “student” of with columns Name and Marks. You have to write a SQL query to get the 2nd highest marks from the table. Also write a query to find the nth highest marks, where n can be any number
- Q3. What is left join. Give example. And Full outer join?
- Ans.
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...
- Q4. What is magic functions and autoloading in PHP?
- Ans.
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
- Q5. Given three arrays sorted in non-decreasing order, print all common elements in these arrays. Examples: ar1[] = {1, 5, 10, 20, 40, 80} ar2[] = {6, 7, 20, 80, 100} ar3[] = {3, 4, 15, 20, 30, 70, 80, 120} Ou...
- Ans.
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
- Q6. A puzzle. You will be given with a 3 Litre container & a 7 Litre Container. Measure exactly 5 Litres of water
- Q7. Asked about one of my projects I mentioned in my resume?
- Q8. Find if a number is a power of 2 or not?
- Ans.
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.
Interview Preparation Tips
College Name: na
Motivation: Overall it was a very good experience. They test you from every aspect. In the End I would like to say that Practo is one of the best companies to work for.
Skills evaluated in this interview
Agam Mahajan
Interview Preparation Tips
Experience: There was Pool Campus Placement of 4 Colleges together(NIT Jalandhar,NIT Hamirpur ,Candigarh University and CGC Landran ) at Chandigarh University.Written test was taken on Hacker Rank. There were 5 Coding Questions of Linklist , Dynamic Programming,Priority Queues etc .
You didn't have to do All the questions (3 can get you to the next round).
One thing that need to be beware of is that on Hacker Rank Your Draft is Saved every second(or so). So don't copy from the internet and just paste there(they will get to know).
Tips: Make sure you practice lot of Algorithms.
Duration: 120 minutes
Total Questions: 5
Round: Problem Statement
Experience: Only 8 Students were selected for this round
20 mins were given for it
and afterwards each student had personal discussion(10 mins) with them to explain their schema .
3-4 Questions were also asked related to your schema and how to perform a particular query
Tips: You should Be Through with DBMS
Make sure there is no redundant table and Primary keys are marked
Round: Technical Interview
Experience: 2 were selected for the Interview
Firstly they make you very Comfortable and ask how were the previous Rounds.
Then they asked about the two questions of First Round and my approach
Then couple of questions on The design that was made Earlier.
Then there were questions on How Internet Works ,gcc,Linux,git,sql.
Then the Interviewer asked if I have any question
I asked about (as the work on doctor's app) how they know the credibility of a doctor which is enlisted in their app.
Interviewer was really Impressed by the question and told me all about it with all details.
Both were selected
Tips: Be cool in the Interview
Think Loudly and Interact with them well.
If they want you to ask any question ,it should not be related to technical stuff ,it should be related to the company
College Name: NIT JALANDHAR
I applied via Referral
Interview Questionnaire
5 Questions
- Q1. I was asked to optimize the last program mentioned above
- Q2. I was asked in detail about my internship experience and projects
- Q3. I was asked why I did not contribute to any open source projects
- Q4. I was asked to explain the code of my android app from my dropbox account
- Q5. The usual HR questions followed after that
Interview Preparation Tips
College Name: NA
Interview Questionnaire
9 Questions
- Q1. What is event bubbling?
- Ans.
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
- Q2. Difference between .on(‘click’,function() and .click(function())
- Ans.
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
- Q3. Write a function to check if two strings are anagram or not
- Ans.
Function to check if two strings are anagram or not
Create two character arrays from the strings
Sort the arrays
Compare the sorted arrays
- Q4. Given an array of integers which can be in one of four order – i.Increasing 2.Decreasing 3.decreasing then increasing 4.increasing then decreasing .Write a function to find the type of array
- Ans.
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
- Q5. How can you improve the performance of a site.(Only frontend)
- Ans.
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
- Q6. Design database schema for a movie site.Where user can watch the movie,genre of movie,give ratings and recommended movies to user.Also Write an algorithm to show recommended movies to user
- Ans.
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
- Q7. By tossing a coin we can get either head or tail, i have a function toss() which return head or tail with equal probability
- Q8. You have to write a function for dice which will return number from 1-6 with equal probability. constraints : you can not use random function, you can use only toss function
- Ans.
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
- Q9. Write a query to fetch duplicate email from table?
- Ans.
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
Interview Preparation Tips
College Name: na
Motivation: Practo is the market leader in digital healthcare management with millions of consumers using our products to find doctors, book appointments and manage their healthcare efficiently. Practo Ray is the platform of choice for the vast majority of doctors and clinics deploying cloud based clinic management solution.I recently got an offer from Practo, here is my interview experience:
Skills evaluated in this interview
I applied via Campus Placement
Interview Questionnaire
4 Questions
- Q1. General questions. Where are you from, tell about yourself etc..,
- Q2. Asked me about the projects which i have mentioned in my resume
- Q3. Some algorithmic questions including data structures. Time complexity, space complexity etc.,
- Q4. How would you design a snake game present in basic nokia mobiles. Just the data structure part and some functions which are used as the game goes on
Interview Preparation Tips
Experience: A bit difficult but sensible way to get started with the selection procedure. Questions purely attack the algorithmic and stastitic aspects.
Tips: Get yourself ready with conceptual clartity regarding algorithms and stastics . Don't be ambitious to attempt all the questions, completely solving one problem would be more than enough for getting through this level.
Duration: 120 minutes
Total Questions: 3
Round: Technical Interview
Experience: Believe me. You never feel inferior, it's really interactive and very friendly. Interviewer gave me a few chances and hints whenever i've gone wrong. Overall interview experience was awesome.
Tips: If you're up to this round, they believe you have the potential. So don't panic if you are unable to answer their questions. Just tell them which aspects which you are comfortable with and they will proceed correspondingly, Just be honest whatsoever.
Skill Tips: Prefer having some revision about the above skills before undergoing the selection process.
Skills: Math Puzzles, Algorithmic Approach To Problem Solving, Data Structures
Duration: 2months
College Name: IIT Madras
Funny Moments: Receiving the offer letter from HR official who visited our campus :)
Pratik Chaudhari
I applied via Referral
Interview Preparation Tips
Experience: Sent resume to an HR through Linkedin and got the call for interview
Round: Technical Interview
Experience: Had 3 rounds of technical interviews with Product Owner, Product Manager and VP Product. Most of the questions were related to maths, statistics and a few on machine learning. Even though I did not have much background on these, I was asked to give my inputs and try to find a solution. We discussed recommendation engines for Quora, Linkedin and e-commerce websites. Then they asked me how can we remove the bias that comes in the practo ratings of the doctors due to feedback from various channels. How can we identify if the customer is booking an appointment by looking at reviews or ratings? How can we identify spam reviews before publishing them? How can we build a product which can help users write a better quality review? Most of the questions were related to data science and how we can improve the products using data. The data analyst role for which I was being interviewed, was a first of its kind role in Practo. The JD was to basically work with the product team and help them in improving products, building new features etc. using data science/ data analytics.
Skills: Product Sense, Attitude, Data Science, Data Analysis, Basics Of Machine Learning
College Name: IIT Madras
Motivation: being the leader of the healthcare industry, high growth startup, opportunity to solve interesting problems using data
Niramai Health Analytix Interview FAQs
Recently Viewed
PHOTOS
InsuranceDekho
3 office photos
LIST OF COMPANIES
Credit Bajaar
Overview
SALARIES
Cadence Design Systems
INTERVIEWS
Info Edge
No Interviews
INTERVIEWS
ANSR Global Corporation
No Interviews
INTERVIEWS
Gap
No Interviews
LIST OF COMPANIES
Gap
Locations
INTERVIEWS
Gap
No Interviews
INTERVIEWS
Thorogood
No Interviews
INTERVIEWS
Gap
No Interviews
Tell us how to improve this page.
Interview Questions for Popular Designations
Niramai Health Analytix Interview Process
based on 4 interviews
Interview experience
Interview Questions from Similar Companies
Niramai Health Analytix Reviews and Ratings
based on 8 reviews
Rating in categories
|
Test Engineer
6
salaries
|  ₹0 L/yr - ₹0 L/yr |
|
Business Development Manager
4
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Zonal Sales Head
4
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Chief Operating Officer
4
salaries
| ₹0 L/yr - ₹0 L/yr |
|
Sr BDM
4
salaries
| ₹0 L/yr - ₹0 L/yr |
Practo
Portea Medical
Lybrate
PharmEasy
- Home >
- Interviews >
- Niramai Health Analytix Interview Questions
