# AppDynamics Interview Questions  eBay Interview Questions

Categories of Questions

## Array Questions AppDynamics

Question 1. Minimum swaps required to bring all elements less than or equal to k together The problem “Minimum swaps required to bring all elements less than or equal to k together” states that you have an integer array. The problem statement asks to find out the smallest count of swaps that will be required to get the elements together which are less than or equal ...

Question 2. Maximal Square In the maximal square problem we have given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s, and return its area. Example   Input: 1 0 1 0 0 0 0 1 1 1 1 1 1 1 1 Please click Like if you ...

Question 3. Insert Delete GetRandom In Insert Delete GetRandom problem we need to design a data structure that supports all following operations in average O(1) time. insert(val): Inserts an item val to the set if not already present. remove(val): Removes an item val from the set if present. getRandom: Returns a random element from the current set ...

## Matrix Questions AppDynamics

Question 4. Maximal Square In the maximal square problem we have given a 2D binary matrix filled with 0’s and 1’s, find the largest square containing only 1’s, and return its area. Example   Input: 1 0 1 0 0 0 0 1 1 1 1 1 1 1 1 Please click Like if you ...

## Other Questions AppDynamics

Question 5. Find the Smallest Divisor given a Threshold Leetcode Solution This post is on Find the Smallest Divisor given a Threshold Leetcode Solution Problem statement   In the problem ” Find the Smallest Divisor Given a Threshold” we are given a nums array and a threshold value. A variable “result” is defined as the sum of all answers when elements in ...