Upload Button Icon Add office photos

Filter interviews by

AppDynamics Senior Software Engineer Interview Questions and Answers

Updated 4 Sep 2024

AppDynamics Senior Software Engineer Interview Experiences

2 interviews found

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Coding Test 

Leetcode medium problem.

Round 2 - Coding Test 

Leetcode medium and test cases.

Round 3 - One-on-one 

(1 Question)

  • Q1. System design, design a distributed kv store
  • Ans. 

    Design a distributed key-value store system

    • Use consistent hashing to distribute data across nodes

    • Implement replication for fault tolerance

    • Use a gossip protocol for node communication

    • Consider data partitioning and sharding for scalability

    • Implement a distributed consensus algorithm like Raft or Paxos for consistency

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Easy interview, get your basics right.

Skills evaluated in this interview

I applied via Company Website and was interviewed in Aug 2022. There were 4 interview rounds.

Round 1 - Coding Test 

Three easy level leetcode questions

Round 2 - Technical 

(1 Question)

  • Q1. 2 leetcode easy dsa question
Round 3 - Technical 

(1 Question)

  • Q1. Projects and 2 leetcode easy level questions
Round 4 - Technical 

(1 Question)

  • Q1. Project and behavioral questions

Interview Preparation Tips

Interview preparation tips for other job seekers - There were 4 rounds all in same day.
After all rounds hr told me that i am selected and that he will share offer letter soon(he also took my documents as well).
Few days after repeatedly ignoring my calls he tells me that they have hired an internal candidate.
Please don't interview for this company, they pay in pennies and the hr are very arrogant and rude.
Worst hr don't care about the interviewee at all, don't waste your time interviewing at this company.

Senior Software Engineer Interview Questions Asked at Other Companies

asked in DBS Bank
Q1. Tell me about yourself. What technology are you using? What is a ... read more
asked in GlobalLogic
Q2. MapSum Pair Implementation Create a data structure named 'MapSum' ... read more
asked in UST
Q3. Nth Prime Number Problem Statement Find the Nth prime number give ... read more
asked in Capgemini
Q4. Pascal's Triangle Construction You are provided with an integer ' ... read more
Q5. K Largest Elements Problem Statement You are given an integer k a ... read more

Interview questions from similar companies

Interview Questionnaire 

9 Questions

  • Q1. Questions related to the work done at my previous company
  • Q2. Find if a given directed graph is cyclic or not
  • Ans. 

    To check if a directed graph is cyclic or not

    • Use Depth First Search (DFS) algorithm to traverse the graph

    • Maintain a visited set to keep track of visited nodes

    • Maintain a recursion stack to keep track of nodes in the current DFS traversal

    • If a node is visited and is already in the recursion stack, then the graph is cyclic

    • If DFS traversal completes without finding a cycle, then the graph is acyclic

  • Answered by AI
  • Q3. You have a stream of bytes from which you can read one byte at a time. You only have enough space to store one byte. After processing those bytes, you have to return a random byte. Note: The probability of...
  • Ans. 

    Return a random byte from a stream of bytes with equal probability.

    • Create a variable to store the count of bytes read

    • Create a variable to store the current random byte

    • For each byte read, generate a random number between 0 and the count of bytes read

    • If the random number is 0, store the current byte as the random byte

    • Return the random byte

  • Answered by AI
  • Q4. Find if a given Binary Tree is BST or not
  • Ans. 

    Check if a binary tree is a binary search tree or not.

    • Traverse the tree in-order and check if the values are in ascending order.

    • For each node, check if its value is greater than the maximum value of its left subtree and less than the minimum value of its right subtree.

    • Use recursion to check if all nodes in the tree satisfy the above condition.

  • Answered by AI
  • Q5. Devise an algorithm to determine the Nth-to-Last element in a singly linked list of unknown length. If N = 0, then your algorithm must return the last element. You should parse the list only once
  • Ans. 

    Algorithm to find Nth-to-Last element in a singly linked list of unknown length

    • Traverse the list and maintain two pointers, one at the beginning and one at Nth node from beginning

    • Move both pointers simultaneously until the second pointer reaches the end of the list

    • The first pointer will be pointing to the Nth-to-Last element

    • If N=0, return the last element

    • Parse the list only once

  • Answered by AI
  • Q6. Given an array of integers, print all possible permutations. Also explain your approach
  • Ans. 

    Print all possible permutations of an array of integers

    • Use recursion to swap elements and generate permutations

    • Start with the first element and swap it with each subsequent element

    • Repeat the process for the remaining elements

    • Stop when all elements have been swapped with the first element

    • Print each permutation as it is generated

  • Answered by AI
  • Q7. Design a Stack DS that also prints in O(1) the minimum element you pushed in the stack
  • Ans. 

    Design a stack that prints the minimum element pushed in O(1)

    • Use two stacks, one for storing elements and another for storing minimums

    • When pushing an element, compare it with the top of minimum stack and push the smaller one

    • When popping an element, pop from both stacks

    • To get the minimum element, just return the top of minimum stack

  • Answered by AI
  • Q8. Given a linked list with loop, how would you find the starting point of the loop ?
  • Ans. 

    To find the starting point of a loop in a linked list, use Floyd's cycle-finding algorithm.

    • Use two pointers, one moving at twice the speed of the other.

    • When they meet, move one pointer to the head of the list and keep the other at the meeting point.

    • Move both pointers one step at a time until they meet again, which is the starting point of the loop.

  • Answered by AI
  • Q9. Find a number a matrix mat[m][n] where all the rows and columns are sorted non-decreasingly. What will be the complexity of the solution
  • Ans. 

    To find a number in a matrix where all rows and columns are sorted non-decreasingly. Complexity of the solution.

    • Use binary search to find the number in each row and column

    • Start from the top-right corner or bottom-left corner to optimize search

    • Time complexity: O(m log n) or O(n log m) depending on the starting corner

  • Answered by AI

Interview Preparation Tips

Skills: Algorithm, Data structure
College Name: Na

Skills evaluated in this interview

I appeared for an interview in Jun 2017.

Interview Questionnaire 

2 Questions

  • Q1. What is HTML, PHP and CSS
  • Ans. 

    HTML, PHP, and CSS are programming languages used for creating and designing websites.

    • HTML (Hypertext Markup Language) is used for creating the structure and content of web pages.

    • PHP (Hypertext Preprocessor) is a server-side scripting language used for creating dynamic web pages.

    • CSS (Cascading Style Sheets) is used for styling and formatting the layout of web pages.

    • Example: HTML is used to create headings, paragraphs, ...

  • Answered by AI
  • Q2. In my technical test, they asked me to replicate the privacy pages of Twitter and facebook.

Interview Preparation Tips

Round: Resume Shortlist
Experience: I was referred to by a friend so this step was comparatively easier.
Tips: Resume should be straightforward and extra and incomplete information should be avoided.

Round: Technical + HR Interview
Experience: A formal face to face interview was conducted. They tested my past knowledge about concepts related to the functioning of their company. It was a smooth interview.
Tips: Be confident, and if you are not thorough with a particular topic, be straightforward and tell the interviewer. Honesty is the best policy to crack an interview.

Round: Client interview
Experience: In this round, a conference call was held between the client in US and me. I was expected to put my exisiting knowledge in to practice to solve the problem at hand.
Tips: Be clear and concise and communicate appropriately. At this stage, a proficiency in English language and a good command over it is a must. Even if you are nervous and sweating, don't EVER show it.

Skills: Technical Analysis, Communication

Skills evaluated in this interview

Interview Questionnaire 

1 Question

  • Q1. Mostly on C language especially strings.Implement strcmp,strcat,strrev and structures and unions.

Interview Preparation Tips

Interview preparation tips for other job seekers - Brush your knowledge on basics of C

I applied via Company Website and was interviewed in Aug 2021. There was 1 interview round.

Interview Questionnaire 

6 Questions

  • Q1. Worst interview process.
  • Q2. Don't go for interview
  • Q3. Worst organization
  • Ans. 

    Worst organization

    • Lack of communication and transparency

    • Inefficient management and decision-making

    • Toxic work culture and lack of employee support

    • Poorly defined goals and objectives

    • Lack of career growth opportunities

  • Answered by AI
  • Q4. I got offer from Oracle and this company also. But due drama I rejected offer this company
  • Q5. Politics in interview
  • Q6. They don't know how to take interview.

Interview Preparation Tips

Interview preparation tips for other job seekers - Better to don't go for interview.
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Core java, spring boot
Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
Selected Selected

I applied via Company Website and was interviewed before Jan 2024. There were 3 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. 2 coding questions
  • Q2. Question on arrays
Round 2 - Technical 

(1 Question)

  • Q1. Coding and sql questions
Round 3 - HR 

(1 Question)

  • Q1. Coding question on arrays

I applied via Naukri.com and was interviewed before Aug 2021. There were 2 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Write a program to sort linked list
  • Ans. 

    Program to sort a linked list

    • Traverse the linked list and compare adjacent nodes

    • Use a temporary node to swap nodes

    • Repeat until the list is sorted

  • Answered by AI
Round 2 - One-on-one 

(1 Question)

  • Q1. They asked me few database related queries and few questions on web apis

Interview Preparation Tips

Interview preparation tips for other job seekers - Keep your logics clear. Don't get depressed, interview was very easy.
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Instahyre and was interviewed before Jun 2023. There were 3 interview rounds.

Round 1 - Coding Test 

Two problem solving questions from leetcode. It was basically easy to medium.

Round 2 - Technical 

(2 Questions)

  • Q1. One coding question from leetcode
  • Q2. Design a movie booking system
  • Ans. 

    A movie booking system allows users to browse movies, select showtimes, choose seats, and make payments online.

    • Users can search for movies by title, genre, or location.

    • Show available showtimes and theaters for selected movie.

    • Select seats and view seating layout for chosen showtime.

    • Provide payment options and confirm booking with email or SMS notification.

  • Answered by AI
Round 3 - HR 

(1 Question)

  • Q1. Mostly about previous work and company culture

Skills evaluated in this interview

AppDynamics Interview FAQs

How many rounds are there in AppDynamics Senior Software Engineer interview?
AppDynamics interview process usually has 3-4 rounds. The most common rounds in the AppDynamics interview process are Coding Test, Technical and One-on-one Round.
What are the top questions asked in AppDynamics Senior Software Engineer interview?

Some of the top questions asked at the AppDynamics Senior Software Engineer interview -

  1. System design, design a distributed kv st...read more
  2. Projects and 2 leetcode easy level questi...read more
  3. Project and behavioral questi...read more

Tell us how to improve this page.

AppDynamics Senior Software Engineer Interview Process

based on 1 interview

Interview experience

4
  
Good
View more
AppDynamics Senior Software Engineer Salary
based on 6 salaries
₹23 L/yr - ₹42 L/yr
132% more than the average Senior Software Engineer Salary in India
View more details

AppDynamics Senior Software Engineer Reviews and Ratings

based on 2 reviews

4.8/5

Rating in categories

4.8

Skill development

5.0

Work-life balance

4.9

Salary

3.9

Job security

4.8

Company culture

3.9

Promotions

4.8

Work satisfaction

Explore 2 Reviews and Ratings
Software Engineer
38 salaries
unlock blur

₹12 L/yr - ₹48.4 L/yr

Software Developer
8 salaries
unlock blur

₹20 L/yr - ₹28 L/yr

Senior Software Engineer
7 salaries
unlock blur

₹23 L/yr - ₹42 L/yr

Software Engineer2
5 salaries
unlock blur

₹20 L/yr - ₹34 L/yr

SDE-2
4 salaries
unlock blur

₹20.1 L/yr - ₹32 L/yr

Explore more salaries
Compare AppDynamics with

Duck Creek Technologies

4.4
Compare

FinThrive

3.7
Compare

Mobileum

3.3
Compare

AgreeYa Solutions

3.3
Compare
Did you find this page helpful?
Yes No
write
Share an Interview