Adobe Member Technical Staff Interview Questions and Answers for Experienced

Given 2 arrays with n and n-1 elements, find the unique element in the larger array.

• Loop through the larger array and check if each element is present in the smaller array.

• If an element is not present in the smaller array, it is the unique element.

• Return the unique element.

• Example: arr1 = ['a', 'b', 'c', 'd'], arr2 = ['a', 'b', 'c'], unique element = 'd'

Density of a person in a social networking graph is the ratio of friends who interacted with the person to the total number of friends.

• Calculate the number of friends who interacted with the person.

• Calculate the total number of friends for that person.

• Divide the number of interacting friends by the total number of friends to get the density.

• Density = (Number of interacting friends) / (Total number of friends)

Given a map of coffee shops and a person, find the closest n coffee shops to him.

• Use the person's location and calculate the distance to each coffee shop on the map.

• Sort the coffee shops by distance and return the closest n.

• Consider using a data structure like a priority queue to efficiently find the closest coffee shops.

Higher studies not necessary for current career goals.

• My current career goals do not require higher studies.

• I have gained enough knowledge and experience through my work.

• I believe in continuous learning and development through on-the-job training and workshops.

• I am open to pursuing higher studies in the future if it aligns with my career goals.

I have worked on various projects involving software development, data analysis, and machine learning.

• Developed a web application for tracking personal fitness goals using React and Node.js

• Implemented a machine learning model to predict customer churn for a telecom company

• Analyzed data from a clinical trial to identify patterns in patient outcomes

Algorithm to find median in a stream of n numbers

• Sort the list and find the middle element for odd n

• For even n, find the average of middle two elements

• Use a min-heap and max-heap to maintain the smaller and larger half of the stream respectively

• Insert new elements into the appropriate heap and balance the heaps to ensure median is always at the top

Given 2 arrays, one with n elements and another with n-1 elements, answer the question.

• Compare the elements of both arrays to find the missing element.

• Use a loop or a built-in function to iterate through the arrays.

• Consider edge cases where the missing element is at the beginning or end of the array.