The first round is for checking problem solving ability. It will contain some 10 questions and no negative marks.The second round is coding . the questions for coding may differ for developers and testers. 3rd technical. 4th again technical 5th with HR
Interview questions [1]
Question 1
There are 100 bulbs lined up in a room. All are turned on in the first pass. Then all the even numbered light bulbs are switched off. After that, every third bulb is switched on. Then all those bulbs that were switched off are turned back on and all those that were lit are turned off. Then the same process is being carried with the fourth bulb and the fifth bulb.
I applied online. I interviewed at athenahealth (Chennai)
Interview
easy level dsa questions like two sum , substring , sorting techniques etc , mysql problems and mysql concepts like primary key , java based technical questions and previous work experience in detail .
I had attended the live coding round. i couldnt remember but it involved array. i get rejected. But it was quite easy for anyone who already aced or practicing leetcode
I applied online. The process took 2 weeks. I interviewed at athenahealth
Interview
Rd1: Recruiter
Rd2: HM Interview - 30m
Rd3: Coding Interview - 90m
Rd4: 2x 90m Coding Interview, 1 Behavioral (Virtual Onsite)
To put it in one sentence, Athenahealth’s interview process is significantly flawed and out of touch. Expect 4.5-6 HOURS of rigorous coding round interviews where you must complete fully optimized working solutions.There’s no care for how, or why you solved the problem. Just get every test case passing, and you’ve got a job. It’s clear this company is more keen on hiring a leetcoder, rather than trying to identify real talent. Other than the HM interview, no other opportunities are given to meet your potential coworkers. Expect to hop on a call with a stone wall of an interviewer, and have no intro’s or icebreaker. This was probably the biggest red flag of all.
Do better athenahealth..
Interview questions [1]
Question 1
1. Summation of numbers across data sets,
2. Run validation logic against multiple list inputs
3. Print hierarchical structure of data sets
4. Find nearest point on a graph