Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Athenahealth interview experience Real time questions & tips from candidates to crack your interview

SDE - 1

Athenahealth

5 rounds | 10 Coding
problems

Interview preparation journey

Preparation

Duration: 4 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: Other

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

Easy

Online Coding Interview

Duration60 minutes

Interview date11 May 2015

Coding problem2

10 Aptitude questions with difficulty level hard were asked in this test.

1. Aptitude Question

Minimum planes to go around the world

Problem approach

The idea is to take hold some planes in the middle, send some planes back and get the fuel to get the main plane fueled again.

Let the three air plane be X, Y and Z. Let total circumference be 300 Units. So every plane can run 150 units.

Let X be the plane that will go around the world.

After 1/6th of the circumference (50 units), Y passes 1/3rd of its fuel to Z and returns (Y ha...

View more

2. Aptitude Question

It rains 3 days a week. When it rains there is Thunderstorm. The probability of Thunderstorm falling on the ground is 1/42000. A Golfer plays golf on Saturday and Sunday. What is the probability of Thunderstorm falling on

that Golfer?

02

Round

Easy

Face to Face

Duration60 minutes

Interview date11 May 2015

Coding problem2

Technical Interview round with questions based on data structures and algorithms. Questions about previous projects done and my roles on it and my leadership capabilities. Few technical questions from Threads and multi-processing.

1. Search In A Row Wise And Column Wise Sorted Matrix

View more

Problem approach

The brute force solution is to traverse the array and to search elements one by one. Run a nested loop, outer loop for row and inner loop for the column

Check every element with x and if the element is found then print “element found”. If the element is not found, then print “element not found”.

Efficient Approach : The idea here is to remove a row or column in each comparison until a...

View more

2. Rectangular Numbers

View more

Problem approach

The number of rows or columns to be printed for given n will be 2*n – 1.

We will print the matrix in two parts. First, print the upper half from rows from 0 to floor((2*n – 1)/2) and then second half from floor((2*n – 1)/2) + 1 to 2*n – 2.

Now for each row, print it in three parts. First part is decreasing sequence which will start from n and decrease by 1 in each iteration. T...

View more

03

Round

Medium

Face to Face

Duration60 minutes

Interview date11 May 2015

Coding problem3

DSA based questions were asked in this round. Questions on implementation of Linux directory structure were also asked.

1. Binary Array Sorting

Problem approach

A two-pointer approach can be used for this question. Maintain two indexes. Initialize the first index left as 0 and second index right as n-1, where n is size of the array .

While left < right , do the following :

a) Keep incrementing index left while arr[left] =0

b) Keep decrementing index right while arr[right]=1

c) If left < right then exchange arr[left] ...

View more

2. Next Greater Element

View more

Problem approach

The brute force solution is to use two loops. The outer loop picks all the elements one by one. The inner loop looks for the first greater element for the element picked by the outer loop. If a greater element is found then that element is printed as next, otherwise, -1 is printed.

Time Complexity: O(N2)

Auxiliary Space: O(1)

The above approach can be optimized using stack da...

View more

3. Technical Question

Difference between BST and Tries

Problem approach

A binary tree or a bst is typically used to store numerical values. The time complexity in a bst is O(log(n)) for insertion, deletion and searching. Each node in a binary tree has at most 2 child nodes.

Trie is an ordered tree structure, which is used mostly for storing strings (like words in dictionary) in a compact way. In a trie, every node (except the root node) stores one character....

View more

04

Round

Easy

Face to Face

Duration60 minutes

Interview date11 May 2015

Coding problem2

This was a technical round. Questions about previous projects and current one were asked. I was also asked about aptitude problems from the first round and how I understood and approached towards solution?

1. N Queens

View more

Problem approach

DFS can be used to solve this problem. The idea is to place queens in different columns one by one, starting from the leftmost column. As we cannot place 2 queens in the same column, when we place the queen in the nth column and if its valid position, dfs again starting n+1 th column and try placing the next queen in all the rows of n+1th column and find a valid position. If no valid queen row ...

View more

2. Form a Triangle

View more

Problem approach

The key observation in the problem is three points form a triangle only when they don’t lie on the straight line, that is an area formed by the triangle of these three points is not equal to zero.

Area of Triangle = (1/2)*(x1 * (y2 - y3) + x2 * (y3 - y1) + x3 * (y1 - y2))

The above formula is derived from shoelace formula.

So we will check if the area formed by the triangle...

View more

05

Round

Easy

HR Round

Duration30 minutes

Interview date11 May 2015

Coding problem1

Behavioral questions and team skills were discussed in this round.

1. Basic HR Question

Q1. Why Athena and why was I shifting from the old company in such a short period?

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

0 comments

0 upvotes

Product Engineer

4 rounds | 4 problems

Interviewed by Squadstack

2051 views

0 comments

0 upvotes

Product Engineer

8 rounds | 14 problems

Interviewed by Squadstack

987 views

0 comments

0 upvotes

Product Developer

3 rounds | 9 problems

Interviewed by Squadstack

758 views

0 comments

0 upvotes

Companies with similar interview experiences

SDE - 1

5 rounds | 12 problems

Interviewed by Amazon

97240 views

24 comments

0 upvotes

SDE - 1

4 rounds | 5 problems

Interviewed by Microsoft

45401 views

5 comments

0 upvotes

SDE - 1

3 rounds | 7 problems

Interviewed by Amazon

28416 views

6 comments

0 upvotes