Upload Button Icon Add office photos

NextGen Healthcare

Compare button icon Compare button icon Compare

Filter interviews by

NextGen Healthcare Senior Software Qa Automation Engineer Interview Questions and Answers

Updated 2 Aug 2024

NextGen Healthcare Senior Software Qa Automation Engineer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Aug 2023. There were 2 interview rounds.

Round 1 - One-on-one 

(3 Questions)

  • Q1. Java strings based questions
  • Q2. Java number based questions
  • Q3. Challenges in daily works
  • Ans. 

    Some challenges in daily work include managing tight deadlines, dealing with constantly changing requirements, and debugging complex issues.

    • Managing tight deadlines for test automation scripts

    • Dealing with constantly changing requirements from stakeholders

    • Debugging complex issues in the automation framework

    • Coordinating with cross-functional teams for testing activities

  • Answered by AI
Round 2 - Technical 

(2 Questions)

  • Q1. Questions on framework Design
  • Q2. Design patterns

Interview questions from similar companies

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

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. Entity framework
  • Q2. Oops concepts asked
Round 2 - Technical 

(2 Questions)

  • Q1. Mvc concepts asked
  • Q2. Ado .net concepts asked
Round 3 - HR 

(2 Questions)

  • Q1. Introduction of career
  • Q2. Agile metrologies

I applied via Naukri.com and was interviewed in Sep 2020. There were 3 interview rounds.

Interview Questionnaire 

6 Questions

  • Q1. Explain Solid Principles with examples
  • Ans. 

    Solid Principles are a set of guidelines for writing maintainable and scalable code.

    • Single Responsibility Principle - A class should have only one reason to change

    • Open/Closed Principle - A class should be open for extension but closed for modification

    • Liskov Substitution Principle - Subtypes should be substitutable for their base types

    • Interface Segregation Principle - Clients should not be forced to depend on interfaces...

  • Answered by AI
  • Q2. Explain OOPs concepts with examples
  • Ans. 

    OOPs concepts are fundamental to object-oriented programming. They include inheritance, encapsulation, abstraction, and polymorphism.

    • Inheritance allows a class to inherit properties and methods from a parent class.

    • Encapsulation is the practice of hiding data and methods within a class, so they can only be accessed through public methods.

    • Abstraction is the process of simplifying complex systems by breaking them down int...

  • Answered by AI
  • Q3. C# ( Concepts on Exception, Garbage collections, Collections and generics, Parallel and asynchronous programming concepts)
  • Q4. MVC lifecycle, filters, routing, session management
  • Q5. Sql concepts like indexes, join queries with example
  • Q6. Prepare enough on Javascript concepts

Interview Preparation Tips

Interview preparation tips for other job seekers - Should be able to explain previous assignments and few challenging feats solved.
Able to explain any architechture or design pattern implementation with benefits achieved

Prepare thoroughly and strongly for fundamentals like oops, c# concepts
and at least have a rough or high level idea on concepts like MVC, Jquery, javascript, sql

I applied via Naukri.com and was interviewed in Jun 2021. There was 1 interview round.

Interview Questionnaire 

1 Question

  • Q1. OOPS Basic concepts, Swap number program, MVC basic questions, .Net framework questions about session, cookies

Interview Preparation Tips

Interview preparation tips for other job seekers - Interviewer was quite professional
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 - Coding Test 

.net framework, C#, OPPs, Assembly, Coding snippets

Round 3 - Technical 

(1 Question)

  • Q1. Basic OPPs, C# and SQL
Round 4 - Technical 

(1 Question)

  • Q1. Scenario based questions
Round 5 - HR 

(1 Question)

  • Q1. Why you want to join Allscripts

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare basics well. Concentrate on OOPs, C# and basic sql queries.
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. Oops concepts and coding questions
Round 3 - HR 

(1 Question)

  • Q1. What is your expected salary and HR related

Interview Preparation Tips

Interview preparation tips for other job seekers - Very good programming knowledge and technical skills
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. Discussion with panel
Round 3 - HR 

(1 Question)

  • Q1. Discussion with hr manager

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview was nice. Panel members has lot of knowledge.
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed before Mar 2023. There were 3 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Understanding of HL7 file format, decoding the different segments, some questions on mumps programming language.
Round 2 - Technical 

(1 Question)

  • Q1. Questions were mostly on SQL and data migration.
Round 3 - Group Discussion 

It was more related to how to handle team culture and behavioral questions following STAR model.

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. It was on Angular and .NET mostly which was my profile job description.

NextGen Healthcare Interview FAQs

How many rounds are there in NextGen Healthcare Senior Software Qa Automation Engineer interview?
NextGen Healthcare interview process usually has 2 rounds. The most common rounds in the NextGen Healthcare interview process are One-on-one Round and Technical.
What are the top questions asked in NextGen Healthcare Senior Software Qa Automation Engineer interview?

Some of the top questions asked at the NextGen Healthcare Senior Software Qa Automation Engineer interview -

  1. Challenges in daily wo...read more
  2. Java strings based questi...read more
  3. Java number based questi...read more

Tell us how to improve this page.

NextGen Healthcare Senior Software Qa Automation Engineer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Globant Interview Questions
3.8
 • 172 Interviews
Chetu Interview Questions
3.3
 • 172 Interviews
Oracle Cerner Interview Questions
3.7
 • 157 Interviews
AVASOFT Interview Questions
3.6
 • 146 Interviews
ServiceNow Interview Questions
4.1
 • 120 Interviews
Thomson Reuters Interview Questions
4.1
 • 112 Interviews
Amadeus Interview Questions
3.9
 • 107 Interviews
SPRINKLR Interview Questions
3.0
 • 100 Interviews
UKG Interview Questions
3.1
 • 100 Interviews
View all
Senior Software Engineer
91 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Engineer
90 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Staff Engineer
88 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

L2 Engineer
60 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
43 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare NextGen Healthcare with

Oracle Cerner

3.7
Compare

Veradigm

4.0
Compare

Athenahealth Technology

4.2
Compare

McKesson

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