Not Specified (Software Engineer/Developer)
Interview Date
Last week of September 2021
Result
Not Specified (Implied Positive)
Difficulty
Medium
Rounds
4 rounds
Drive Type
On-Campus
Topics asked
Detailed experience
College: College in Pune
Interview Date: Last week of September 2021
Interview Type: On-Campus
Result: Not Specified (Implied Positive)
Difficulty: Medium
Rounds: 4 rounds
Topics Asked: Data Structures (Stack, Queue, Trees, BST, HashMap, HashSet, Linked List, Graphs, Dijkstra's algorithm), OOP (4 pillars, Garbage Collection, Memory Leaks, Inheritance, Scope of variables), Java (JIT compiler, String vs StringBuilder), Projects, Internship experience, Caesar Cipher decryption, Bitonic array problem, Quant aptitude, Logic, Code output prediction, Behavioral questions.
AthenaHealth visited a college in Pune in the last week of September 2021 for on-campus recruitment. The process involved four rounds.
Round 1: Coding & MCQ (90 minutes)
This round was conducted on HackerRank. It included two coding problems (one easy worth 50 marks, one medium worth 75 marks) and 10 MCQs (5 marks each). MCQs covered basic data structures, quant aptitude, logic, and code output prediction. One coding problem was based on the Caesar Cipher decryption technique, and another was an Apple interview problem. Candidates were advised to spare enough time for MCQs due to extensive reading required.
Round 2: Technical Interview (45 minutes)
This round was conducted on HackerRank's Codepair platform, involving shared screen coding and video calling. The interviewer emphasized DSA and OOP. After a brief introduction focusing on the tech stack, questions covered: What is a data structure and its types? Can stack be implemented using a queue? What is the principle of a stack? Why are trees needed, and how are they traversed (all three ways expected)? Why did BST come into existence? Difference between HashMap and HashSet. How to decide which data structure to use? Can binary search be performed on a linked list? How linked lists work internally? Do graphs have a defined structure? Real-time examples of graphs and graph traversals. Dijkstra's algorithm (logic and applications). JIT compiler explanation. Questions on the logic used in the HackerRank coding problems and why test cases might have failed. Scope of variables (local and global). OOP questions (details not recollected). A problem statement related to a bitonic array was given on CodePair for execution and desired output. The candidate discussed their approach and complexity before coding.
Round 3: Managerial Interview
This round involved an in-depth discussion on projects mentioned in the resume, including the tech stack, architecture, and code modules with class names. Cross-questions were frequent. Discussion also covered internship work, role, learnings, and challenges. Java questions included garbage collection and memory leaks, and the four pillars of OOP were expected with in-depth explanations. The panelist was friendly and offered project suggestions. A question on handling work pressure was also asked.
Round 4: HR Interview
The HR round started with an introduction including family background and native places. Questions included: How was the experience in previous rounds? Why do you want to be part of AthenaHealth? What are your principles in life? Any plans for higher education? Long-term plans (10 years ahead)? Any other internship/job offers? The candidate asked questions about work culture. The interviewer was friendly and ended with, "If everything gets well, I'll see you in the office!"