Athenahealth Technology Senior Java Developer Interview Questions and Answers

I was given a problem to solve.

Q1. Was asked about Java and JavaScript. Technical questions
Add your answer
Q2. Oops concepts with relevance to objects and classes
Add your answer
Q3. Core java concepts
Add your answer
Q4. Sql queries were asked given a table for reference
Add your answer

Q1. Behavioural questions
Add your answer

Q1. Entity framework
Add your answer
Q2. .net core questions
Add your answer

Q1. Oops, c#, design , .net framework
Add your answer

Q1. Managerial, projects
Add your answer

It was an MCQ based test. Code Snippets as well as OOPS, OS, DBMS questions were there

Q1. How to implement a stack OS Questions Problem Solving Questions OOPS concepts DS questions
Add your answer

Q1. Smart Pointers About the project done in college
Add your answer

Q1. Input output pointers related
Add your answer
Q2. Polymorphism,casting class,
Add your answer

Q1. Data structure used for snake and ladder
Add your answer

IT was basic question from string and array

Q1. Data structure question find all leaf node from tree.
Ans. 
Use depth-first search to traverse the tree and identify leaf nodes.
• Implement depth-first search algorithm to traverse the tree.

• Identify nodes with no children as leaf nodes.

• Store leaf nodes in an array for retrieval.
Answered by AI
Add your answer
Q2. Print sentence word in reverse order without using default function. eg: input:-> I live in New York. output:-> I evil ni weN kroY.
Ans. 
Reverse each word in a sentence without using default function.
• Split the sentence into words

• Iterate through each word and reverse it

• Join the reversed words back into a sentence
Answered by AI
Add your answer

Q1. Programming question :Fibonacci series using recursion.
Ans. 
Fibonacci series using recursion is a classic programming problem where each number is the sum of the two preceding ones.
• Define a recursive function that takes an integer n as input

• Base case: if n is 0 or 1, return n

• Recursive case: return the sum of the previous two Fibonacci numbers

• Call the function recursively with n-1 and n-2 until base case is reached
Answered by AI
Add your answer
Q2. Programming question: Find 1st 2nd and 3rd highest from array of integer.
Ans. 
Find 1st, 2nd, and 3rd highest integers from an array.
• Sort the array in descending order.

• Retrieve the first three elements from the sorted array.

• Handle cases where array length is less than 3.
Answered by AI
Add your answer

Q1. They asked Puzzle
Add your answer

Q1. Salary Discussion
Add your answer

Q1. Question on Template concept in c++
Add your answer
Q2. Questions related to string
Add your answer