Upload Button Icon Add office photos

eClinicalWorks

Compare button icon Compare button icon Compare

Filter interviews by

eClinicalWorks Product Manager Interview Questions and Answers

Updated 25 Dec 2024

eClinicalWorks Product Manager Interview Experiences

1 interview found

Product Manager Interview Questions & Answers

user image Prashant Sorathia

posted on 25 Dec 2024

Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Selected Selected
Round 1 - Assignment 

An easy assignment that involved a use case.

Round 2 - Technical 

(2 Questions)

  • Q1. Previous projects
  • Q2. Scenario based questions

Interview questions from similar companies

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

I applied via Campus Placement and was interviewed before Oct 2022. There were 2 interview rounds.

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 tips
Round 2 - Technical 

(3 Questions)

  • Q1. Typical Product Management questions, which app like, which changes would you suggest
  • Q2. Then second round taken by a person who asks questions based on your CV regarding Product management.
  • Q3. Third Round taken by a very senior person and is a case based interview.

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare typical prod man questions and case based questions.
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 tips
Round 2 - Technical 

(1 Question)

  • Q1. Tell us about one product owned and built from scratch
  • Ans. 

    Developed a mobile app for tracking daily water intake

    • Conducted user research to identify pain points and desired features

    • Designed wireframes and user interface using Sketch

    • Collaborated with developers to build and test the app

    • Implemented features such as reminders and progress tracking

    • Launched the app on both iOS and Android platforms

  • Answered by AI
Round 3 - One-on-one 

(1 Question)

  • Q1. Why do you want to join ServiceNow?

Interview Preparation Tips

Interview preparation tips for other job seekers - Focus on basics, give industry best practices, strengths, weaknesses
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

Talk about yourself, what you have done, achievements, challenges you have faced, etc

Round 2 - Case Study 

Will be given a random case study, which you will have to evaluate and show case why, how and what problem you are trying to solve.

Round 3 - Technical 

(1 Question)

  • Q1. Cybersecurity related questions. Solve a randomly given problem
Round 4 - Case Study 

Again case study, what you have done in the past and why? How you prioritised what you did and why.

Round 5 - Technical 

(1 Question)

  • Q1. Solving technical problems, how you will work with engineering, peers and cross functional team. How you can extract the best from them without having any authority over them.
Round 6 - Cultural fit 

(1 Question)

  • Q1. Where you have worked before and how you have handled conflict between another colleague and yourself or between two stakeholders. How you will convince someone who is very strong headed.
Round 7 - One-on-one 

(1 Question)

  • Q1. Cultural fit, why you want to work for this company and why do you think you should be hired. Past experiences, etc

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep your cool, think logically, KNOW your resume, study about ServiceNow
Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-

I applied via Referral and was interviewed in Jan 2024. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Favorite product
  • Ans. 

    My favorite product is the iPhone because of its sleek design, user-friendly interface, and seamless integration with other Apple products.

    • Sleek design

    • User-friendly interface

    • Seamless integration with other Apple products

  • Answered by AI
  • Q2. Past experience

Interview Preparation Tips

Interview preparation tips for other job seekers - Previous product that you owrked on
Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Resume overview
  • Q2. Product case studies
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed in Apr 2024. There was 1 interview round.

Round 1 - Technical 

(1 Question)

  • Q1. Product roadmap
Interview experience
3
Average
Difficulty level
-
Process Duration
2-4 weeks
Result
Not Selected

I applied via Company Website and was interviewed in Jul 2024. There was 1 interview round.

Round 1 - One-on-one 

(4 Questions)

  • Q1. Questions on guesstimates
  • Q2. Questions on previous work experience
  • Q3. Questions on agile methodology
  • Q4. Vertical based understanding

Interview Questionnaire 

21 Questions

  • Q1. AVL tree balance checking
  • Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
  • Ans. 

    Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity

    • Use binary search to find the partition point in both arrays

    • Calculate the median based on the partition point and array sizes

    • Adjust the partition points based on the median value

    • Repeat until the partition points are at the median

    • Handle edge cases such as empty arrays and uneven array sizes

  • Answered by AI
  • Q3. Strings Anagram in O(1) space complexity
  • Ans. 

    Anagram of strings in O(1) space complexity

    • Use a fixed size array of integers to store the frequency of characters in the first string

    • Iterate through the second string and decrement the frequency of each character in the array

    • If all the frequencies are zero, then the strings are anagrams

    • Return true or false accordingly

  • Answered by AI
  • Q4. Level order traversal of a tree using Queue
  • Ans. 

    Level order traversal of a tree using Queue

    • Create a queue and add the root node to it

    • While the queue is not empty, remove the front node and print its value

    • Add the left and right child nodes of the removed node to the queue

    • Repeat until the queue is empty

  • Answered by AI
  • Q5. Reverse level order traversal of a tree using Queue
  • Ans. 

    Reverse level order traversal of a tree using Queue

    • Create a queue and push the root node into it

    • While the queue is not empty, pop the front node and push its children into the queue

    • Add the popped node to a stack

    • Once the queue is empty, pop elements from the stack and print them

  • Answered by AI
  • Q6. BFS and DFS Difference
  • Ans. 

    BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.

    • BFS uses a queue while DFS uses a stack or recursion.

    • BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.

    • BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.

    • BFS can be used to find connected components while DFS

  • Answered by AI
  • Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
  • Q8. Parenthesis Balance Checking
  • Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
  • Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
  • Ans. 

    Find product of each element of an array except that element in O(N) time complexity without using / operation

    • Use prefix and suffix products

    • Multiply prefix and suffix products for each element to get the final product

    • Handle edge cases where array has 0 or 1 element separately

  • Answered by AI
  • Q11. Recursively deleting linked list
  • Ans. 

    Recursively delete a linked list

    • Create a recursive function that takes the head of the linked list as input

    • Base case: if the head is null, return

    • Recursively call the function with the next node as input

    • Delete the current node

  • Answered by AI
  • Q12. Recursively deleting linked list from end
  • Ans. 

    Recursively delete a linked list from the end.

    • Start from the head and recursively traverse to the end of the list.

    • Delete the last node and set the second last node's next pointer to null.

    • Repeat until the entire list is deleted.

    • Use a recursive function to implement the deletion process.

  • Answered by AI
  • Q13. Recursively deleting tree
  • Ans. 

    Recursively delete a tree by deleting all its child nodes and then the parent node.

    • Start from the leaf nodes and delete them first.

    • Then move up to the parent nodes and delete them.

    • Repeat until the root node is deleted.

    • Use post-order traversal to ensure child nodes are deleted before parent nodes.

  • Answered by AI
  • Q14. Recursively deleting from end
  • Ans. 

    Recursively delete elements from the end of an array.

    • Create a recursive function that removes the last element of the array.

    • Call the function recursively until the desired number of elements are removed.

    • Handle edge cases such as empty arrays and removing more elements than the array contains.

  • Answered by AI
  • Q15. Difference between Floyd Warshall and Djikstra
  • Ans. 

    Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.

    • Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.

    • Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).

    • Floyd Warshall can handle negative edge weights while Djikstra cannot.

    • Floyd Warshall can detect negative cycles while Dj

  • Answered by AI
  • Q16. Shortest path between 2 points in 2-D space in O(log N) time
  • Ans. 

    There is no known algorithm to find shortest path in 2-D space in O(log N) time.

    • The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).

    • Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).

    • If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).

  • Answered by AI
  • Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
  • Ans. 

    Design a system for putting newspapers using classes and functions

    • Create a Newspaper class with attributes like title, date, and content

    • Create a Publisher class with methods to publish and distribute newspapers

    • Create a Subscriber class with methods to subscribe and receive newspapers

    • Use inheritance to create different types of newspapers like daily, weekly, etc.

    • Implement a database to store newspaper information and ha

  • Answered by AI
  • Q18. SQL commands
  • Q19. Career Prospects - Long Term Plans
  • Q20. Why not higher studies?
  • Ans. 

    I believe practical experience is more valuable than higher studies.

    • I have gained valuable experience through internships and projects.

    • I prefer hands-on learning and problem-solving over theoretical knowledge.

    • I am constantly learning and improving my skills through online courses and workshops.

  • Answered by AI
  • Q21. Machine Learning Concepts - Based on my projects

Interview Preparation Tips

Round: Test
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.

Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.

General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc

Skills evaluated in this interview

I applied via LinkedIn and was interviewed in Apr 2021. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. All were technical. Just keep practicing data structures and Algorithms and have good knowledge of the language you're good at.

Interview Preparation Tips

Interview preparation tips for other job seekers - Hey Folks
Just never get discouraged by your failures. Keep working hard and be consistent in your efforts. You will surely achieve what you deserve.

eClinicalWorks Interview FAQs

How many rounds are there in eClinicalWorks Product Manager interview?
eClinicalWorks interview process usually has 2 rounds. The most common rounds in the eClinicalWorks interview process are Assignment and Technical.
How to prepare for eClinicalWorks Product Manager interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at eClinicalWorks. The most common topics and skills that interviewers at eClinicalWorks expect are Product Management, Project Management, Business Analysis, Agile and Coordination.
What are the top questions asked in eClinicalWorks Product Manager interview?

Some of the top questions asked at the eClinicalWorks Product Manager interview -

  1. Scenario based questi...read more
  2. Previous proje...read more

Tell us how to improve this page.

eClinicalWorks Product Manager Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more
eClinicalWorks Product Manager Salary
based on 11 salaries
₹8.5 L/yr - ₹30.5 L/yr
21% less than the average Product Manager Salary in India
View more details

eClinicalWorks Product Manager Reviews and Ratings

based on 1 review

4.0/5

Rating in categories

4.0

Skill development

5.0

Work-life balance

5.0

Salary

5.0

Job security

4.0

Company culture

4.0

Promotions

5.0

Work satisfaction

Explore 1 Review and Rating
Software Specialist
488 salaries
unlock blur

₹2 L/yr - ₹10.3 L/yr

Strategic Account Manager
222 salaries
unlock blur

₹3.2 L/yr - ₹11.5 L/yr

Project Manager
204 salaries
unlock blur

₹4.2 L/yr - ₹13 L/yr

Implementation Specialist
137 salaries
unlock blur

₹3 L/yr - ₹12 L/yr

Technical Support Engineer
120 salaries
unlock blur

₹3 L/yr - ₹10 L/yr

Explore more salaries
Compare eClinicalWorks with

24/7 Customer

3.5
Compare

Thomson Reuters

4.1
Compare

Oracle Cerner

3.7
Compare

NextComm Corporation

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