Athenahealth Technology Member Technical Staff Interview Questions, Process, and Tips

Prepare recurrsion and tree problems

Most in Tree and String problems

Basic logical questions and live changes to work it alternately

Q1. Java Advanced questions based out of collections threads
Add your answer
Q2. Linked list and string based codes
Add your answer

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

Coding was on java string array concepts

Q1. Technical discussion on spring boot
Add your answer

Q1. About project and stuffs which we did
Add your answer

Q1. General organisation related
Add your answer

Hacker rank - 2 coding questions

Q1. Average program questions in any language
Add your answer

Q1. Day to day work and team meetingd
Add your answer