Athenahealth interview experience Real time questions & tips from candidates to crack your interview
Software Developer
Athenahealth
4 rounds | 12 Coding problems
Interview preparation journey
Preparation
Duration: 6 months
Topics: Data Structures, Algorithms, System Design, Aptitude, OOPS
Tip

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application process
Where: Campus
Eligibility: Above 7 CGPA
Resume tip

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Interview rounds
01
Round
Medium
Online Coding Interview
Duration60 minutes
Interview date30 Nov 2015
Coding problem3

This was a test round where 10 aptitude based questions were to be solved in 60 minutes

1. Puzzle

5 Pirates and 100 Gold Coins

Problem approach

A uses the facts below to get 98 :
Consider the situation when A, B, and C die, only D and E are left. E knows that he will not get anything (D is senior and will make a distribution of (100, 0). So E would be fine with anything greater than 0.
Consider the situation when A and B die, C, D, and E are left. D knows that he will not get anything (C will make...

View more
2. Puzzle

N people were in a party and were seated in a circular manner. If each of the two present in the party, except the pairs that were adjacent, sang a song and If a song lasted for 2 mins and 28 mins was taken for singing the songs. How would you solve for N?

Problem approach

Solving in a brute force manner,start with the N=4 and continue by increasing the N by 1. Keep checking how many minutes it will take for the condition to be satisfied.
For N=4 , time to sing songs (T) = 4
N=5, T=10
N=6, T=18
N=7, T=28
N=8, T=40
We can see a definite pattern here, For this question T=N*(N-3)
So check for which value of N the equation is t...

View more
3. Puzzle

Letâ€™s play a game of Russian roulette. You are tied to your chair and canâ€™t get up. Hereâ€™s a gun. Hereâ€™s the barrel of the gun, six chambers, all empty. Now watch me as I put a single bullet in the gun. I close the barrel and spin it. I put a gun to your head and pull the trigger. Click. Lucky you! Now Iâ€™m going to pull the trigger one more time. Which would you prefer, that I spin the barrel f...

View more
02
Round
Medium
Face to Face
Duration60 minutes
Interview date30 Nov 2015
Coding problem4

They took us to the lab for this on and we were each given a paper with a program on it. It was all mixed as in each person got a different paper, You have around an hour to finish coding. after which you have to explain your code. They also gave wrong or incorrect inputs and see how your code handles these exceptions.

1. Reverse the String
Easy
15m average time
85% success
0/40

#### For example:

View more
Problem approach

This can be done by iterative swapping using two pointers. The first pointer points to the beginning of the string, whereas the second pointer points to the end. Both pointers keep swapping their elements and go towards each other. Essentially, the algorithm simulates the rotation of a string with respect to its midpoint.
Time Complexity : O(n)

2. K Largest Element
Moderate
10m average time
90% success
0/80

#### You are given an unsorted array containing â€˜Nâ€™ integers. You need to find â€˜Kâ€™ largest elements from the given array. Also, you need to return the elements in non-decreasing order.

Problem approach

To solve the question using a max heap, make a max heap of all the elements of the list. Run a loop for k-1 times and remove the top element of the heap. After running the loop, the element at top will be the kth largest element, return that. Time Complexity : O(n + klogn)
The question can also be solved using a min heap.
Approach:
1. Create a min heap class with a capacity of k<...

View more
3. Remove character
Easy
0/40

#### The input string w...

View more
4. Pattern: Triangle of numbers
Easy
15m average time
85% success
0/40

#### Ninja is given a pattern. Now he is asked to print the same pattern for any given â€˜Nâ€™ number of rows.

``````For example, Pattern for â€˜Nâ€™ = 4 will be.
1
232
34545
4567654
``````
View more
Problem approach

printPattern(int n)
{
// Outer loop to handle number of rows n in this case
for (int i = 0; i < n; i++) {
// Inner loop to handle number of columns values changing acc. to outer loop
for (int j = 0; j <= i; j++) {
Print stars (*)
}

Print new line
}
}

03
Round
Easy
Face to Face
Duration60 minutes
Interview date30 Nov 2015
Coding problem4

Compared to the other round this is more tech oriented. Lot more tech questions. It is of normal difficulty and is not that hard to clear, you only need to know the basics.
Very basic of Data Structure and Oracle knowledge enough. Lots of simple questions from data structures(insert into heaps etc). They did not ask to write code for DS, but rather to explain the logic through diagrams. For some complicated question, they expect how much you brainstorm ideas in solving

1. Convert binary tree to mirror tree
Easy
15m average time
85% success
0/40

#### A binary tree is a tree in which each parent node has at most two children.

View more
Problem approach

This can be solved using recursion.
Steps :
(1) Call Mirror for left-subtree i.e., Mirror(left-subtree)
(2) Call Mirror for right-subtree i.e., Mirror(right-subtree)
(3) Swap left and right subtrees.
temp = left->subtree
left->subtree = right->subtree
right->subtree = temp

Worst-case Time complexity is O(n)
Auxiliary space complexity : O(h)...

View more
2. Heap Sort
Easy
15m average time
85% success
0/40

#### You are given an array â€˜ARRâ€™ consisting of 'N' integers, and your task is to sort the given array in non-decreasing order using the Heap sort algorithm.

Problem approach

Heap sort is a comparison-based sorting technique based on Binary Heap data structure. It is similar to selection sort where we first find the minimum element and place the minimum element at the beginning. We repeat the same process for the remaining elements.

Algorithm :

HeapSort(arr)
BuildMaxHeap(arr)
for i = length(arr) to 2
swap arr[1] with arr[i]&n...

View more
3. DBMS Question

What is indexing?

Problem approach

Indexing is a data structure technique used to efficiently retrieve records from the database files. It helps optimize the performance of a database by minimizing the number of disk accesses required when a query is processed.

4. Technical Question

Which is better - B Tree or Hash table?

Problem approach

1. B+ tree is costly to maintain since it needs to be updated after every insertion and deletion.
2. Hash based indexing is efficient in equity queries whereas B+ trees are efficient in range queries.
3. Efficiency of hash based index is low in case of large no. of repeated key values because of hash collision problems.
4. Hash index is not efficient in sorting.
5. Hash index is eff...

View more
04
Round
Easy
HR Round
Duration30 minutes
Interview date30 Nov 2015
Coding problem1

This round lasted for around 30 minutes. It more of a character analysis round with a lot of HR type questions.

1. Basic HR Questions

2. Most of the questions were focused on Patient, Hospital, Insurance So they asked me to create a scenario connecting those three entities.

Problem approach

Tip 1 : The cross questioning can go intense some time, think before you speak.
Tip 2 : Be open minded and answer whatever you are thinking, in these rounds I feel it is important to have opinion.
Tip 3 : Context of questions can be switched, pay attention to the details. It is okay to ask questions in these round, like what are the projects currently the company is investing, which team ...

View more
Start a Discussion
Similar interview experiences
SDE - 1
4 rounds | 5 problems
Interviewed by Athenahealth
1296 views
Associate Software Engineer
4 rounds | 5 problems
Interviewed by Athenahealth
769 views
Software Developer
3 rounds | 8 problems
Interviewed by Athenahealth
512 views
Product Engineer
3 rounds | 5 problems
759 views
Companies with similar interview experiences
Software Developer
5 rounds | 14 problems
Interviewed by Microsoft
2446 views