Upload Button Icon Add office photos
Engaged Employer

i

This company page is being actively managed by HALODOC Team. If you also belong to the team, you can get access from here

HALODOC Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

HALODOC Engineering Manager Interview Questions and Answers

Updated 7 Jul 2023

HALODOC Engineering Manager Interview Experiences

1 interview found

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

Practise data structures based problems, should be able to explain the code and optimizations etc

Round 3 - Case Study 

Design system for e-commerce. How to scale the system with the demand

Round 4 - One-on-one 

(2 Questions)

  • Q1. Building ML ops platform from scratch.
  • Ans. 

    Building a ML ops platform involves designing infrastructure, tools, and processes to streamline machine learning workflows.

    • Design scalable infrastructure to support ML model training and deployment

    • Implement version control for ML models and data

    • Automate testing and monitoring of ML models

    • Integrate with CI/CD pipelines for continuous deployment

    • Provide collaboration tools for data scientists and engineers

  • Answered by AI
  • Q2. Data governance strategy
Round 5 - Behavioral 

(2 Questions)

  • Q1. Team management. Conflict resolution
  • Q2. Stakeholder management. Planning

Skills evaluated in this interview

Interview questions from similar companies

Interview experience
4
Good
Difficulty level
Hard
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Jun 2023. There were 5 interview rounds.

Round 1 - Coding Test 

Coding Test and Code review comprehension Round

Round 2 - Technical 

(1 Question)

  • Q1. Questions related to CDN, Recommendation Engine and Designing a system that is online (Twitter/Instagram etc)
Round 3 - Technical 

(1 Question)

  • Q1. Questions related to DNS Resolution, Database related Questions and System Design
Round 4 - Technical 

(1 Question)

  • Q1. Queries related to how to scale a service, and DB Normalizations
Round 5 - One-on-one 

(1 Question)

  • Q1. This was a Cultural Fit Round

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare firsthand on the concepts and be very specific on the answers, while solving the problem be very mindful of keeping the conversations going with the interviewer.
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Technical 

(1 Question)

  • Q1. How to process purchase invoice
  • Ans. 

    To process a purchase invoice, follow these steps:

    • Verify the invoice details like vendor name, invoice number, date, and amount

    • Check if the goods or services mentioned in the invoice were received or rendered

    • Enter the invoice details in the accounting system

    • Match the invoice with the purchase order and goods receipt note

    • Obtain approval from the authorized personnel

    • Make the payment to the vendor within the payment terms

  • Answered by AI
Round 3 - HR 

(1 Question)

  • Q1. Salary negotiation
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Nov 2023. There were 2 interview rounds.

Round 1 - Aptitude Test 

Basic maths & English

Round 2 - HR 

(2 Questions)

  • Q1. Previous experience
  • Q2. Why you select this company
  • Ans. 

    I selected this company because of its strong reputation, innovative culture, and opportunities for growth.

    • Strong reputation in the industry

    • Innovative culture that fosters creativity and growth

    • Opportunities for career advancement and development

    • Positive reviews from current and former employees

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Salary ontime will receive, attractive incentive & Internal job promotion

I applied via Referral and was interviewed before Jul 2021. There was 1 interview round.

Round 1 - HR 

(1 Question)

  • Q1. Work experiance and process knowledge

Interview Preparation Tips

Interview preparation tips for other job seekers - Do not join this company very bad work culture
Interview experience
3
Average
Difficulty level
-
Process Duration
2-4 weeks
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Design middleware for homepage
  • Ans. 

    Design middleware to handle requests and responses for homepage

    • Identify the key functionalities needed for the homepage middleware

    • Implement caching mechanisms to improve performance

    • Ensure proper error handling and logging

    • Consider scalability and load balancing for high traffic

    • Integrate with analytics tools for tracking user behavior

  • Answered by AI

Skills evaluated in this interview

I applied via Naukri.com and was interviewed in Mar 2022. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. About my past experience & manpower handling.

Interview Preparation Tips

Interview preparation tips for other job seekers - Easy Interview.

I was interviewed before Apr 2021.

Round 1 - Coding Test 

(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 N representing 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.

  • Answered by AI
  • 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...

  • 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
  • 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...

  • Answered by AI
Round 2 - Face to Face 

(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...

  • Answered by AI
  • 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.

  • Answered by AI
  • Q3. You have a 3-liter jar and a 5-liter jar. How can you measure exactly 4 liters using these two jars?
Round 3 - Face to Face 

(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

  • Answered by AI
  • 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.

  • Answered by AI
  • 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...

  • Answered by AI
  • 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
Round 4 - HR 

(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

Eligibility criteriaAbove 7 CGPAPracto interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, DBMS, OS, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

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.

Application resume tips for other job seekers

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.

Final outcome of the interviewSelected

Skills evaluated in this interview

Software Engineer Interview Questions & Answers

Medlife user image nerella saikrishna

posted on 9 Jan 2016

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...

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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...

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
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

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

  • Answered by AI
  • 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...

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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.

  • Answered by AI

Interview Preparation Tips

Skills: Data structures, PHP, Algortihm
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

Contribute & help others!
anonymous
You can choose to be anonymous

HALODOC Interview FAQs

How many rounds are there in HALODOC Engineering Manager interview?
HALODOC interview process usually has 5 rounds. The most common rounds in the HALODOC interview process are Resume Shortlist, Coding Test and Case Study.
What are the top questions asked in HALODOC Engineering Manager interview?

Some of the top questions asked at the HALODOC Engineering Manager interview -

  1. building ML ops platform from scrat...read more
  2. Stakeholder management. Plann...read more
  3. Data governance strat...read more

Recently Viewed

SALARIES

HALODOC

INTERVIEWS

Keyence

No Interviews

INTERVIEWS

Patil Group

No Interviews

INTERVIEWS

Intel

No Interviews

INTERVIEWS

AdaniConneX

No Interviews

INTERVIEWS

Intel

No Interviews

INTERVIEWS

Intel

No Interviews

SALARIES

Avanti Fellows

LIST OF COMPANIES

Avanti Fellows

Locations

SALARIES

Corizo

Tell us how to improve this page.

Interview Questions from Similar Companies

Tata 1mg Interview Questions
3.6
 • 146 Interviews
PharmEasy Interview Questions
3.7
 • 80 Interviews
MedPlus Interview Questions
3.6
 • 79 Interviews
Practo Interview Questions
3.2
 • 74 Interviews
HealthifyMe Interview Questions
3.0
 • 47 Interviews
Netmeds.com Interview Questions
3.6
 • 42 Interviews
Portea Medical Interview Questions
4.3
 • 27 Interviews
Medlife Interview Questions
3.7
 • 27 Interviews
Fourkites Interview Questions
3.8
 • 17 Interviews
View all
HALODOC Engineering Manager Salary
based on 16 salaries
₹51 L/yr - ₹70 L/yr
61% more than the average Engineering Manager Salary in India
View more details

HALODOC Engineering Manager Reviews and Ratings

based on 3 reviews

2.2/5

Rating in categories

2.0

Skill development

1.7

Work-life balance

3.0

Salary

1.5

Job security

2.2

Company culture

1.7

Promotions

2.2

Work satisfaction

Explore 3 Reviews and Ratings
Engineering Manager
16 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Development Engineer II
15 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Development Engineer
13 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Developer
12 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Sdet 2
12 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare HALODOC with

Practo

3.2
Compare

Lybrate

3.5
Compare

Portea Medical

3.8
Compare

PharmEasy

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview