Upload Button Icon Add office photos

NextGen Healthcare

Compare button icon Compare button icon Compare

Filter interviews by

NextGen Healthcare Senior Staff Engineer Interview Questions and Answers

Updated 10 May 2024

NextGen Healthcare Senior Staff Engineer Interview Experiences

Interview questions from similar companies

I applied via Referral and was interviewed in Dec 2020. There were 7 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. OOPS, C#, ASP.NET SQL

Interview Preparation Tips

Interview preparation tips for other job seekers - Just prepare with the basics
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 tips
Round 2 - One-on-one 

(1 Question)

  • Q1. Explain end to end automation cycle
  • Ans. 

    End to end automation cycle involves automating the entire software development process from planning to deployment.

    • The cycle starts with requirements gathering and planning

    • Next, the code is developed and tested using automation tools

    • Continuous integration and delivery are used to deploy the code to production

    • Monitoring and feedback are used to improve the process

    • Examples of automation tools include Jenkins, Selenium,

  • Answered by AI
Round 3 - HR 

(1 Question)

  • Q1. Why do you want to join this company.

Skills evaluated in this interview

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 Recruitment Consultant and was interviewed before Nov 2020. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Subject wise questions

Interview Preparation Tips

Interview preparation tips for other job seekers - HR negotiations are to be done with a confidence.

I applied via Campus Placement and was interviewed before Nov 2021. There were 3 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 - Aptitude Test 

There are 30 basic aptitude question in 30 minutes

Round 3 - Coding Test 

3 coding question 2 were easy and 1 was of medium level

Interview Preparation Tips

Interview preparation tips for other job seekers - i was not selected in HR round . they select only two girls out 15 students

I applied via Campus Placement and was interviewed before Sep 2021. There were 4 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 - Aptitude Test 

Math and verbal round .

Round 3 - Group Discussion 

General topics to speak

Round 4 - Technical 

(1 Question)

  • Q1. Duplicates in array College Projects Hashmap implementation
  • Ans. 

    Implement a function to find duplicates in an array of strings using Hashmap.

    • Create a Hashmap to store the frequency of each string in the array

    • Iterate through the array and check if the frequency of any string is greater than 1

    • If yes, add it to the list of duplicates

    • Return the list of duplicates

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Answer what you know, be genuine and honest

Skills evaluated in this interview

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

Interview Questionnaire 

1 Question

  • Q1. Sql based quedtion

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare continuously don't lose hope

I applied via Recruitment Consultant and was interviewed in May 2019. There were 4 interview rounds.

Interview Questionnaire 

3 Questions

  • Q1. What is your day to day work?
  • Q2. What new you have to offer the organization?
  • Q3. The most recent issues that you faced in the organization?

Interview Preparation Tips

Interview preparation tips for other job seekers - Be true to yourself and the interviewer, he/she doesn't want you to be full of all technical skills. He/she wants you to be atleast good at the things mentioned in your resume. Showcase that you're ready to switch to any language even if it is uncomfortable for you

I was interviewed before Sep 2020.

Round 1 - Coding Test 

(1 Question)

Round duration - 90 minutes
Round difficulty - Medium

It was Technical + Aptitude MCQ round.The technical section consisted if MCQ related to DSA,OS,DBMS.The aptitude section consisted of questions related to basic mathematics.

  • Q1. 

    Candies Distribution Problem Statement

    Prateek is a kindergarten teacher with a mission to distribute candies to students based on their performance. Each student must get at least one candy, and if two s...

  • Ans. 

    The task is to distribute candies to students based on their performance while minimizing the total candies distributed.

    • Create an array to store the minimum candies required for each student.

    • Iterate through the students' ratings array to determine the minimum candies needed based on the given criteria.

    • Consider the ratings of adjacent students to decide the number of candies to distribute.

    • Calculate the total candies req...

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 30 minutes
Round difficulty - Medium

It was a technical interview testing the basic skills of OS and DBMS of candidates along with few project discussions from your CV.

  • Q1. Can you write 15 Linux commands along with their functions?
  • Ans. 

    List of 15 Linux commands with their functions

    • ls - list directory contents

    • pwd - print working directory

    • cd - change directory

    • mkdir - make a new directory

    • rm - remove files or directories

    • cp - copy files and directories

    • mv - move or rename files and directories

    • grep - search for patterns in files

    • chmod - change file permissions

    • ps - display information about running processes

    • top - display and update sorted information about pr...

  • Answered by AI
  • Q2. What are DDL (Data Definition Language) and DML (Data Manipulation Language)?
  • Ans. 

    DDL is used to define the structure of database objects, while DML is used to manipulate data within those objects.

    • DDL includes commands like CREATE, ALTER, DROP to define database objects like tables, indexes, etc.

    • DML includes commands like INSERT, UPDATE, DELETE to manipulate data within tables.

    • Example of DDL: CREATE TABLE employees (id INT, name VARCHAR(50));

    • Example of DML: INSERT INTO employees VALUES (1, 'John Doe

  • Answered by AI

Interview Preparation Tips

Professional and academic backgroundI completed Computer Science Engineering from Vellore Institute of Technology. I applied for the job as System Engineer in BangaloreEligibility criteriaAbove 8 CGPACerner Corporation interview preparation:Topics to prepare for the interview - Data Structures, DBMS, Linux, Algorithms,Cloud computing, Operating systemsTime required to prepare for the interview - 2 monthsInterview preparation tips for other job seekers

Tip 1 : Be clear about the concepts of Linux and shell scripting.
Tip 2 : Learn about the basics of Data structures and Algorithm.
Tip 3 : Be prepared to explain your projects mentioned in your CV.

Application resume tips for other job seekers

Tip 1 : Use professional Keywords in your resume.
Tip 2 : Don't mention anything you are not confident in.

Final outcome of the interviewSelected

NextGen Healthcare Interview FAQs

How many rounds are there in NextGen Healthcare Senior Staff Engineer interview?
NextGen Healthcare interview process usually has 2 rounds. The most common rounds in the NextGen Healthcare interview process are Technical and Behavioral.
How to prepare for NextGen Healthcare Senior Staff Engineer 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 NextGen Healthcare. The most common topics and skills that interviewers at NextGen Healthcare expect are AWS, Healthcare, Agile Methodology, Computer science and Agile.
What are the top questions asked in NextGen Healthcare Senior Staff Engineer interview?

Some of the top questions asked at the NextGen Healthcare Senior Staff Engineer interview -

  1. Static Class, Singleton Pattern, Microservice, Linq, Interface, SO...read more
  2. SQL Case statement, C# patt...read more

Tell us how to improve this page.

NextGen Healthcare Senior Staff Engineer Interview Process

based on 1 interview

Interview experience

3
  
Average
View more

Interview Questions from Similar Companies

Chetu Interview Questions
3.3
 • 172 Interviews
Oracle Cerner Interview Questions
3.7
 • 157 Interviews
AVASOFT Interview Questions
3.7
 • 154 Interviews
ServiceNow Interview Questions
4.1
 • 120 Interviews
Thomson Reuters Interview Questions
4.1
 • 112 Interviews
Amadeus Interview Questions
3.9
 • 107 Interviews
EbixCash Limited Interview Questions
4.0
 • 102 Interviews
UKG Interview Questions
3.1
 • 100 Interviews
SPRINKLR Interview Questions
3.0
 • 100 Interviews
View all
NextGen Healthcare Senior Staff Engineer Salary
based on 26 salaries
₹19 L/yr - ₹48 L/yr
16% less than the average Senior Staff Engineer Salary in India
View more details

NextGen Healthcare Senior Staff Engineer Reviews and Ratings

based on 6 reviews

2.3/5

Rating in categories

2.5

Skill development

2.7

Work-life balance

2.3

Salary

2.1

Job security

2.8

Company culture

2.7

Promotions

2.5

Work satisfaction

Explore 6 Reviews and Ratings
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