Athenahealth Technology Interview Questions, Process, and Tips

ABOUT CLOUD, DSA, DBMS, computer science fundamentals

Q1. About projects, OOPS, DBMS, DSA
Add your answer

Q1. About projects, javascript
Add your answer

Q1. General questions, about company
Add your answer

Question from streams, one string based question and some general spring boot related question

Q1. Walkthrough your proudest project
Add your answer
Q2. What were the most challenging and most rewarding parts of the project?
Add your answer

Q1. Collaborative working session - design thinking round
Add your answer
Q2. Design problem on healthcare sector
Add your answer

Q1. Cross collaboration round
Add your answer

Basic aptitude concepts

2 Questions on sorting and profit related question

Q1. Technical questions like oops,sql queries. And previous round coding question different approaches.
Add your answer
Q2. Sorting question
Add your answer
Q3. Sql query on 2nd highest salary
Ans. 
Use SQL query with ORDER BY and LIMIT to find the 2nd highest salary.
• Use ORDER BY clause to sort salaries in descending order

• Use LIMIT 1,1 to skip the first highest salary and get the second highest salary
Answered by AI
Add your answer
Q4. Difference between tuple and delete command
Ans. 
Tuple is a data structure that stores a fixed number of elements, while delete command is used to remove data from a database table.
• Tuple is used to store multiple values in a single variable, while delete command is used to remove specific rows from a database table.

• Tuples are immutable, meaning their values cannot be changed once they are set, while delete command permanently removes data from a table.

• Example: Tuple ...read more
Answered by AI
Add your answer

Coding test included a use case that needed to be read and solution based on data structures.

It was an online test with coding & MCQ's

Q1. Find largest increasing subsequence count from an array of numbers
Ans. 
The largest increasing subsequence count from an array of numbers is to find the length of the longest increasing subsequence.
• Iterate through the array and keep track of the length of the longest increasing subsequence encountered so far.

• Use dynamic programming to solve the problem efficiently.

• Example: For the array [10, 22, 9, 33, 21, 50, 41, 60, 80], the longest increasing subsequence count is 6.
Answered by AI
Add your answer
Q2. How would you design a binary tree, write a snippet to print all nodes.
Ans. 
Design and print all nodes of a binary tree.
• Design a binary tree structure with left and right child pointers for each node.

• Implement a recursive function to print all nodes of the binary tree.

• Start from the root node and recursively print the left subtree, then the root, and finally the right subtree.
Answered by AI
Add your answer
Q3. Rest were all genenral questions - Authentication used in your application, design patterns etc.
Add your answer