Upload Button Icon Add office photos

Adobe

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Adobe Member Technical Staff Interview Questions, Process, and Tips

Updated 17 Jul 2024

Top Adobe Member Technical Staff Interview Questions and Answers

  • Q1. Maximum Sum Problem Statement You are given an array ARR of N integers. Your task is to perform operations on this array until it becomes empty, and maximize the sum of ...read more
  • Q2. Detect and Remove Loop in Linked List For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified li ...read more
  • Q3. Predecessor and Successor in Binary Search Tree (BST) Given a binary search tree (BST) with 'N' nodes, find the predecessor and successor of a given 'KEY' node in the BS ...read more
View all 20 questions

Adobe Member Technical Staff Interview Experiences

6 interviews found

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Reverse linked list
Interview experience
5
Excellent
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement and was interviewed before May 2023. There were 3 interview rounds.

Round 1 - Coding Test 

It was basic DSA round consisting of DP question and Graph question.

Round 2 - Technical 

(1 Question)

  • Q1. 2 Technical Rounds with standard DSA of around 1300 codeforces level. OS was also asked.
Round 3 - HR 

(1 Question)

  • Q1. Final HR round asking general questions about myself and my future goals.

Interview Preparation Tips

Interview preparation tips for other job seekers - Have faith in yourself and have unique approach towards problem solving.

Member Technical Staff Interview Questions Asked at Other Companies

Q1. Next Smallest Palindrome Problem Statement Find the next smallest ... read more
asked in Salesforce
Q2. Buy and Sell Stock Problem Statement Imagine you are Harshad Meht ... read more
Q3. Check Permutation Problem Statement Given two strings 'STR1' and ... read more
asked in Salesforce
Q4. Optimal Strategy for a Coin Game You are playing a coin game with ... read more
asked in Salesforce
Q5. Longest Happy String Problem Statement Given three non-negative i ... read more
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Referral and was interviewed before Mar 2023. There were 5 interview rounds.

Round 1 - Coding Test 

Hackker Rank test with 20 MCQ and 2 coding questions

Round 2 - Coding Test 

Coding Interview question - ugly number, kadane algorithm

Round 3 - Coding Test 

More coding questions with LRU and Design a data structure with o(1) insertion, deletion, search time and few technical questions

Round 4 - Project Experience 

(1 Question)

  • Q1. Questions regarding previous project experience.
Round 5 - Behavioral 

(1 Question)

  • Q1. 1 DSA question and questions based on project and some puzzles as well as some one word answers.

Interview Preparation Tips

Skill Tips: Be good at C++. Keep your CGPA high
Skills:
College Name: NIT Surathkal

Adobe interview questions for designations

 Technical Staff Member 2

 (2)

 Senior Member Technical

 (1)

 Staff Engineer

 (1)

 Technical Consultant

 (5)

 Technical Lead

 (1)

 Senior Technical Consultant

 (4)

 Associate Technical Consultant

 (2)

 Technical Support Engineer

 (2)

I was interviewed before Jan 2021.

Round 1 - Coding Test 

(2 Questions)

Round duration - 120 Minutes
Round difficulty - Medium

This was an online Coding+MCQ round. Both the coding questions were related to DP and were of Medium to Hard Difficulty.The MCQ's were of easy-medium level but one has to be fast in order to complete the section in the given time frame.

  • Q1. 

    Maximum Sum Problem Statement

    You are given an array ARR of N integers. Your task is to perform operations on this array until it becomes empty, and maximize the sum of selected elements. In each operatio...

  • Ans. 

    Given an array, select elements to maximize sum by removing adjacent elements.

    • Iterate through the array and keep track of the count of each element.

    • Select the element with the highest count first, then remove adjacent elements.

    • Repeat the process until the array is empty and sum the selected elements.

  • Answered by AI
  • Q2. 

    Longest Common Prime Subsequence Problem Statement

    Imagine Ninja is tackling a puzzle during his long summer vacation. He has two arrays of integers, each with lengths 'N' and 'M'. Ninja's task is to dete...

  • Ans. 

    Find the length of the longest common prime subsequence between two arrays of integers.

    • Iterate through both arrays to find prime numbers

    • Use a set to keep track of common prime numbers

    • Return the size of the set as the length of the longest common prime subsequence

  • Answered by AI
Round 2 - Face to Face 

(4 Questions)

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 Algorithmic questions wherein I was supposed to code both the problems after discussing their approaches and respective time and space complexities . After that , I was grilled on some OOPS concepts related to C++.

  • Q1. 

    Detect and Remove Loop in Linked List

    For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.

    Expected Complexity:

    A...

  • Ans. 

    Detect and remove loop in a singly linked list in place with O(n) time complexity and O(1) space complexity.

    • Use Floyd's Cycle Detection Algorithm to identify the loop in the linked list.

    • Once the loop is detected, use two pointers to find the start of the loop.

    • Adjust the pointers to remove the loop and return the modified linked list.

  • Answered by AI
  • Q2. 

    Stack using Two Queues Problem Statement

    Develop a Stack Data Structure to store integer values using two Queues internally.

    Your stack implementation should provide these public functions:

    Explanation:

    ...
  • Ans. 

    Implement a stack using two queues to store integer values with specified functions.

    • Create a stack class with two queue data members.

    • Implement push(data), pop(), top(), size(), and isEmpty() functions.

    • Use one queue for pushing elements and another for temporary storage during operations.

    • Ensure proper handling of edge cases such as empty stack.

    • Example: If input is Q = 5, 1 42, 2, 3, 1 17, the output should be 42, -1, 17

  • Answered by AI
  • Q3. What are Vtable and VPTR in C++?
  • Ans. 

    Vtable and VPTR are used in C++ for implementing polymorphism through virtual functions.

    • Vtable (Virtual Table) is a table of function pointers used to implement dynamic dispatch in C++ for virtual functions.

    • VPTR (Virtual Pointer) is a pointer that points to the Vtable of an object, allowing dynamic binding of virtual functions at runtime.

    • Vtable is created for each class that has virtual functions, containing pointers t...

  • Answered by AI
  • Q4. What are friend functions in C++?
  • Ans. 

    Friend functions in C++ are functions that are not members of a class but have access to its private and protected members.

    • Friend functions are declared inside a class with the keyword 'friend'.

    • They can access private and protected members of the class.

    • They are not member functions of the class, but have the same access rights as member functions.

    • Example: friend void displayDetails(Student);

  • Answered by AI
Round 3 - Face to Face 

(4 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This round had 3 preety good questions related to DSA and some questions revolving around Memory Management and Operating Systems.

  • Q1. 

    Predecessor and Successor in Binary Search Tree (BST)

    Given a binary search tree (BST) with 'N' nodes, find the predecessor and successor of a given 'KEY' node in the BST.

    Explanation:

    The predecessor o...

  • Ans. 

    Find predecessor and successor of a given node in a binary search tree (BST).

    • Predecessor is the node visited just before the given node in an inorder traversal.

    • Successor is the node visited immediately after the given node in an inorder traversal.

    • Return -1 if predecessor or successor does not exist.

    • Implement inorder traversal to find predecessor and successor.

  • Answered by AI
  • Q2. 

    Count Ways to Reach the N-th Stair Problem Statement

    You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...

  • Ans. 

    The problem involves counting the number of distinct ways to climb N stairs by taking 1 or 2 steps at a time.

    • Use dynamic programming to solve the problem efficiently.

    • The number of ways to reach the Nth stair is the sum of the number of ways to reach the (N-1)th stair and the (N-2)th stair.

    • Handle base cases for N=0 and N=1 separately.

    • Apply modulo operation to avoid overflow while calculating the result.

    • Consider using me...

  • Answered by AI
  • Q3. 

    Good Arrays Problem Statement

    You are given an array 'A' of length 'N'. You must choose an element from any index in this array and delete it. After deleting the element, you will obtain a new array of le...

  • Ans. 

    Given an array, find the number of 'good' arrays that can be formed by deleting one element.

    • Iterate through each element in the array and check if deleting it results in a 'good' array

    • Keep track of the sum of elements at odd and even indices to determine if the array is 'good'

    • Return the count of 'good' arrays

  • Answered by AI
  • Q4. What is memory protection in operating systems?
  • Ans. 

    Memory protection in operating systems prevents one process from accessing or modifying the memory of another process.

    • Memory protection ensures that each process has its own isolated memory space.

    • It prevents unauthorized access to memory locations, improving system stability and security.

    • Operating systems use techniques like virtual memory and access control lists to enforce memory protection.

    • Examples include segmentat...

  • Answered by AI

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAdobe interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 4 MonthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Get interview-ready with Top Adobe Interview Questions

Interview Questionnaire 

15 Questions

  • Q1. How to find a loop in a Linked List and how to remove it
  • Ans. 

    To find and remove a loop in a Linked List, we can use Floyd's Cycle Detection Algorithm.

    • Use two pointers, slow and fast, to detect if there is a loop in the Linked List

    • If the two pointers meet at some point, there is a loop

    • To remove the loop, set one of the pointers to the head of the Linked List and move both pointers one step at a time until they meet again

    • The meeting point is the start of the loop, set the next poi

  • Answered by AI
  • Q2. Suppose there is an unsorted array. What will be the maximum window size, such that when u sort that window size, the whole array becomes sorted. Eg, 1 2 6 5 4 3 7 . Ans: 4 (6 5 4 3)
  • Ans. 

    Find the maximum window size to sort an unsorted array.

    • Identify the longest decreasing subarray from the beginning and longest increasing subarray from the end

    • Find the minimum and maximum element in the identified subarrays

    • Expand the identified subarrays until all elements in the array are covered

    • The length of the expanded subarray is the maximum window size

  • Answered by AI
  • Q3. How to find longest last occurring word in a sentence with multiple whitespace
  • Ans. 

    Finding the longest last occurring word in a sentence with multiple whitespace.

    • Split the sentence into words using whitespace as delimiter

    • Reverse the list of words

    • Iterate through the list and find the first occurrence of each word

    • Calculate the length of each last occurring word

    • Return the longest last occurring word

  • Answered by AI
  • Q4. What is merge sort and Quick sort. Adv and Disadv of each and which one would u use to sort huge list and Y
  • Ans. 

    Merge sort and Quick sort are sorting algorithms used to sort arrays of data.

    • Merge sort is a divide and conquer algorithm that divides the input array into two halves, sorts each half recursively, and then merges the sorted halves.

    • Quick sort is also a divide and conquer algorithm that selects a pivot element and partitions the array around the pivot, sorting the two resulting sub-arrays recursively.

    • Merge sort has a tim...

  • Answered by AI
  • Q5. Define Process &thread
  • Ans. 

    Process is an instance of a program while thread is a subset of a process that can run concurrently with other threads.

    • A process is a program in execution

    • A process can have multiple threads

    • Threads share the same memory space as the process

    • Threads can run concurrently with other threads within the same process

    • Examples of processes include web browsers, word processors, and media players

    • Examples of threads include GUI th

  • Answered by AI
  • Q6. What happens when an recursive function is called
  • Ans. 

    A recursive function calls itself until a base case is reached, then returns the result to the previous call.

    • Each call creates a new instance of the function on the call stack

    • The function continues to call itself until a base case is reached

    • Once the base case is reached, the function returns the result to the previous call

    • The previous call then continues executing from where it left off

  • Answered by AI
  • Q7. Solve and code the problem of a ball falling from staircase. Each jump can be of 1 step or 2. Find the number of combination of reaching step N
  • Ans. 

    Code to find number of combinations of reaching step N by ball falling from staircase with 1 or 2 steps per jump.

    • Use dynamic programming to solve the problem

    • Create an array to store the number of ways to reach each step

    • Initialize the array with base cases for steps 0, 1, and 2

    • Use a loop to fill in the array for steps 3 to N

    • The number of ways to reach step i is the sum of the number of ways to reach step i-1 and i-2

    • Retu

  • Answered by AI
  • Q8. Puzzle: There is a grid of soldier standing. Soldier ‘A’ is chosen: The tallest men from every column and the shortest among them. Soldier ‘B’ is chosen: The shortest men from every row and the tallest amo...
  • Q9. What’s priority queue. How will u make stack and queue with priority queue
  • Ans. 

    Priority queue is a data structure that stores elements with priority levels and retrieves them in order of priority.

    • Priority queue is implemented using a heap data structure.

    • Stack can be implemented using a priority queue by assigning higher priority to the most recently added element.

    • Queue can be implemented using a priority queue by assigning higher priority to the oldest element.

  • Answered by AI
  • Q10. Implement stack using queue
  • Ans. 

    Implementing stack using queue involves using two queues to simulate stack behavior.

    • Create two queues, q1 and q2.

    • Push operation: Enqueue the element to q1.

    • Pop operation: Dequeue all elements from q1 to q2 except the last element. Dequeue and return the last element.

    • Swap the names of q1 and q2 after each pop operation.

    • Top operation: Return the last element of q1 without dequeuing it.

    • isEmpty operation: Check if both q1 a

  • Answered by AI
  • Q11. About myself
  • Q12. About my family. I mentioned my dad is my idol, so he asked y. M I more like my dad or my mom.
  • Q13. My toughest moment in life and how I overcame it
  • Ans. 

    I lost my job during the pandemic and struggled to find a new one

    • Applied to multiple job openings daily

    • Networked with former colleagues and industry professionals

    • Took online courses to improve skills

    • Maintained a positive attitude and stayed motivated

    • Eventually landed a new job in a different industry

  • Answered by AI
  • Q14. What had I been if I hadn’t been an engg
  • Ans. 

    I would have pursued a career in music or writing.

    • I have always had a passion for music and writing.

    • I have played multiple instruments since childhood.

    • I have written and published short stories and poetry.

    • I believe creativity is an important aspect of any profession.

  • Answered by AI
  • Q15. What do I value most in life. (A real life example)
  • Ans. 

    I value my relationships with loved ones the most.

    • Spending quality time with family and friends

    • Making an effort to stay in touch with long-distance loved ones

    • Prioritizing important events and milestones in their lives

    • Being there for them during difficult times

    • Forgiving and working through conflicts to maintain strong bonds

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: He went
through my CV and asked me something about making an android app. (Note: I had
mentioned Android a couple of times in CV) I explained him how a basic app is
made with model (XML) and layout (Java). He told me about connector which
connects model to layout. Then he asked the two questions. For second ques, I gave a N square approach (dynamic).
He suggested a greedy approach of Order N. It was fitting most cases so I wrote
the code on greedy approach. Turned out, greedy wasn’t the solution anyway.
Doesn’t matter. (Note: Boss is always right!!!)

Round: Technical Interview
Experience: He went
through my CV and asked me about my dropped grades in 12th.In third question, interesting part was, he said me to answer only if I knew it. I replied that I know but the definition isn’t totally memorized and he said to let it go then. (PS: Learn basic defs)
Tips: Ans to 5) is Fibonacci and 6) is A is taller than B

Round: Technical Interview
Experience: He
went through my CV and asked my if I had done Intern in Amazon or Training.
Followed by, he asked me why I didn’t get a PPO there. He then asked me, which
subject I m more confident with: Algo types or OS types. I chose algo.
Tips: Keep your cool and code with confidence. Reason I am saying this is because, he was the senior most interviewer and somehow, he knew the art to stress test you.

Round: HR Interview
Experience: 1)     
Be honest

2)     
Sit with open palms

3)     
Don’t cross your hands or legs(if legs can be
visible)

4)     
Keep some back stories ready. Use any names, use your friends story anything to make it real. It will go a long way because nobody is
going to verify it.

5)     
Most imp, Be confident about yourself. If you r not
sure of yourself, you would be useless to the company.

General Tips: Code Daily. Practise. Basics are important in such interviews.
Skill Tips: Do refer the previous question sets. It gives you pretty good idea of what's expected of you.
Skills: Algorithm, Puzzle solving, Technical Knowledge, Soft Skills, Data structures
College Name: IIT DHANBAD
Funny Moments: When in first round, I knew greedy approach isn't right, But I went on with it, because I could hear my dad whispering in my ears from behind, Rule 1: Boss is always Right
Rule 2: In case of doubt, refer Rule 1...

Skills evaluated in this interview

Member Technical Staff Jobs at Adobe

View all

Interview questions from similar companies

I applied via Campus Placement and was interviewed in Dec 2016. There were 3 interview rounds.

Interview Questionnaire 

4 Questions

  • Q1. Given 2 arrays of n and n - 1elements which have n - 1 in common find the unique elements
  • Ans. 

    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'

  • Answered by AI
  • Q2. Given a social networking graph find the density of a person. Density is how many friends he had interaction with him and the person by the total number of friends for that person
  • Ans. 

    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)

  • Answered by AI
  • Q3. Given a map of coffee shops and a person on the map give the closest n coffee shops to him
  • Ans. 

    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.

  • Answered by AI
  • Q4. Why not higher studies ?
  • Ans. 

    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.

  • Answered by AI

Interview Preparation Tips

Round: Technical Interview
Experience: Solved it using xor.

Round: Technical Interview
Experience: Designed it as 2 graphs and then find the activity and find density.

Round: Technical Interview
Experience: Preprocess it and give answer. There is no wrong or right just a design question.

Round: HR Interview
Experience: Want to experience industry.

College Name: IIT Madras

Skills evaluated in this interview

I was interviewed before Mar 2021.

Round 1 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Th interviewer asked me questions related to various topics of OS, Data Structures and Algorithm.
Tips: Have a strong hold on topics of OS like segmentation and buddy systems.

  • Q1. What is segmentation?
  • Ans. 

    Segmentation is the process of dividing a larger entity into smaller parts or segments.

    • Segmentation is commonly used in image processing to separate objects of interest from the background.

    • It is also used in marketing to divide a target market into smaller groups based on demographics, behavior, or other factors.

    • In networking, segmentation refers to dividing a network into smaller subnetworks to improve performance and

  • Answered by AI
  • Q2. What are the advantages and disadvantages of the buddy system?
  • Ans. 

    The buddy system has advantages like increased safety and support, but also drawbacks like dependency and lack of independence.

    • Advantages: increased safety, support, accountability, motivation

    • Disadvantages: dependency, lack of independence, potential for conflicts

    • Example: In a buddy system at work, colleagues can support each other in completing tasks and provide motivation to stay on track.

    • Example: However, relying to...

  • Answered by AI
  • Q3. What is a page fault?
  • Ans. 

    A page fault occurs when a program tries to access a page of memory that is not currently in physical RAM.

    • Occurs when a program tries to access a page of memory not in physical RAM

    • Results in the operating system needing to retrieve the page from disk

    • Can lead to a temporary pause in program execution

  • Answered by AI
Round 2 - Face to Face 

(2 Questions)

Round duration - 60 minutes
Round difficulty - Easy

The round consisted of questions of heap, Towers of hanoi and other questions related to CV.
Tips: Time complexity analysis of Towers of Hanoi Problem is important. Good skillset in DS and Algorithms, Bit Manipulation.

  • Q1. 

    Tower of Hanoi Problem Statement

    You have three rods numbered from 1 to 3, and 'N' disks initially stacked on the first rod in increasing order of their sizes (largest disk at the bottom). Your task is to...

  • Ans. 

    Tower of Hanoi problem where 'N' disks need to be moved to another rod following specific rules in less than 2^N moves.

    • Implement a recursive function to move disks from one rod to another following the rules.

    • Use the concept of recursion and backtracking to solve the Tower of Hanoi problem efficiently.

    • Maintain a count of moves and track the movement of disks in a 2-D array/list.

    • Ensure that larger disks are not placed on...

  • Answered by AI
  • Q2. 

    Convert Array to Min Heap Task

    Given an array 'ARR' of integers with 'N' elements, you need to convert it into a min-binary heap.

    A min-binary heap is a complete binary tree where each internal node's va...

  • Ans. 

    Convert the given array into a min-binary heap by modifying the array elements.

    • Iterate through the array and heapify each node starting from the last non-leaf node to the root node.

    • For each node, compare it with its children and swap if necessary to satisfy the min-heap property.

    • Continue this process until the entire array is converted into a min-heap.

  • Answered by AI
Round 3 - HR 

Round duration - 30 minutes
Round difficulty - Easy

The HR asked about my hobbies, extra curricular activities and checked my personality.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAVMware Software India Private Limited interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

I was interviewed before Sep 2016.

Interview Questionnaire 

3 Questions

  • Q1. Tell us about your projects
  • Ans. 

    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

  • Answered by AI
  • Q2. Discussed the approach for the questions solved in the problem statement
  • Q3. You are given a list of n numbers. How would you find the median in this stream. You are given an array. Give an algorithm to randomly shuffle it.
  • Ans. 

    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

  • Answered by AI

Interview Preparation Tips

Round: Resume Shortlist
Experience: They came to recruit on campus in NIT Trichy. They had come for 4 profiles - Application Development, Server Technologies, MySQL and SUN microsystems
Tips: It's mostly about CGPA and your profile. Most of the people about CGPA of 7.00 we're shortlisted

Round: Problem Statement
Experience: 1) Reversing a linked list
2) K closest stars
3) Find the range of indices of occurrence of a duplicated number in a sorted array.
Tips: Easy questions. Do geeksforgeeks and leetcode and should be a breeze.

Round: Technical Interview
Experience: Explained in details about my projects and the reasoning behind the approaches followed.
Tips: Try to thoroughly know about your projects and the different approaches you took and then this round should be easy.

The interviewer does a lot of cross questioning so you should really know the project inside out.

Round: Technical Interview
Experience: Details discussion about the approach and the different ways of optimizing the space and time complexities.
Tips: It's a discussion where they are trying to gauge your ability to think through a problem and be able to discuss the complexities and why did you prefer your solution.

Round: Technical Interview
Experience: A median is the n/2th number in case n is odd or the average of (n/2 and (n+1)/2 ) numbers when n is even. So,for the first question I used two heaps. One minheap and one maxheap. The minheap is used to store the larger set of numbers and the max heap is used to store the smaller set of numbers. We try to maintain an even sized heaps. And then try to get the top of the max heap if n is odd, otherwise the average of the minheap and maxheap in case n is even. Had to code in C++.

Fisher-yates shuffle algorithm. Had to code in C++.
Tips: Standard Geeksforgeeks questions.

Skills: C++, MARKETING APTITUDE, SQL, Algorithmic Approach To Problem Solving, Data Structures

Skills evaluated in this interview

Interview Preparation Tips

Round: Test
Tips: You should be familiar with OOP concepts and a few concepts like binary tree. Also aptitude and quant questions (like in CAT). They will test your coding skills thoroughly during the test (only in the prog. language that you opted) and will question your logic and your approach to the problem. Be thorough with your coding basics.

Round: Technical Interview
Tips: The tech rounds focused mostly on coding. You can choose any programming language that you are comfortable with. They are not insistent that you know Java. I chose C++. The interviewers mainly look at how you approach the questions (the way you solve the question - if its the most efficient/fastest solution to the problem). They will also ask quite a lot of puzzles (the ones you can prepare from Heard on the street, 400 puzzles etc.) and a few CAT quant qns.

Round: HR Interview
Experience: HR round is very easy
Tips: basic qns that you will prepare for any company. Be sure to attend the PPT; the HR will surely ask you a few qns from it. Also know a bit about the company and the profile you are sitting for.

General Tips: The test is the only criteria for getting shortlisted to the interview round. There are certain Oracle profiles that are only open for CS and one which has a CG cutoff of 8.5. But for the App Dev profile there was no CG cutoff. your performance in the test is most important,because they generally do not entertain walkins during interview. Resume is not that important. Only HR team will have a look at it. If you have any coding experience (from any projects) or Java certification then its an added bonus. But its not mandatory.
1st year- concentrate on CGPA
2nd year - find out what you want(core or noncore). Do internships in starts ups or finance or consult companies if aiming for non-core. PORs are important
3rd year- internships.
4th year- start placement preparation very early. 
Work well on your project if you want to go for core.
College Name: IIT MADRAS
Contribute & help others!
anonymous
You can choose to be anonymous

Adobe Interview FAQs

How many rounds are there in Adobe Member Technical Staff interview?
Adobe interview process usually has 3 rounds. The most common rounds in the Adobe interview process are Coding Test, Technical and Behavioral.
How to prepare for Adobe Member Technical Staff interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Adobe. The most common topics and skills that interviewers at Adobe expect are Adobe, Automation Testing, Javascript, C++ and Computer Science.
What are the top questions asked in Adobe Member Technical Staff interview?

Some of the top questions asked at the Adobe Member Technical Staff interview -

  1. Suppose there is an unsorted array. What will be the maximum window size, such ...read more
  2. What is merge sort and Quick sort. Adv and Disadv of each and which one would u...read more
  3. Puzzle: There is a grid of soldier standing. Soldier ‘A’ is chosen: The tal...read more

Recently Viewed

INTERVIEWS

Cairn Oil

No Interviews

INTERVIEWS

Axis Bank

No Interviews

INTERVIEWS

Directi

No Interviews

INTERVIEWS

Plaid

No Interviews

INTERVIEWS

Cognizant

No Interviews

INTERVIEWS

Baker Hughes

No Interviews

LIST OF COMPANIES

ICICI Prudential Life Insurance

Overview

INTERVIEWS

Polaris Consulting

No Interviews

INTERVIEWS

Newzera Tech Labs

No Interviews

INTERVIEWS

Tega Industries

No Interviews

Tell us how to improve this page.

Adobe Member Technical Staff Interview Process

based on 3 interviews

1 Interview rounds

  • Coding Test Round
View more
Adobe Member Technical Staff Salary
based on 118 salaries
₹9.5 L/yr - ₹30.8 L/yr
61% more than the average Member Technical Staff Salary in India
View more details

Adobe Member Technical Staff Reviews and Ratings

based on 10 reviews

4.1/5

Rating in categories

3.7

Skill development

4.5

Work-life balance

4.3

Salary

4.2

Job security

4.2

Company culture

3.8

Promotions

3.7

Work satisfaction

Explore 10 Reviews and Ratings
Member of Technical Staff - II

Noida

3-5 Yrs

Not Disclosed

Member of Technical Staff - II

Noida

2-5 Yrs

Not Disclosed

Member Technical Staff - 2

Noida

2-7 Yrs

Not Disclosed

Explore more jobs
Computer Scientist
441 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Technical Consultant
278 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
254 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Computer Scientist 2
231 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Technical Consultant
204 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Adobe with

Salesforce

4.0
Compare

Oracle

3.7
Compare

Microsoft Corporation

4.0
Compare

Amazon

4.1
Compare
Did you find this page helpful?
Yes No
write
Share an Interview
Rate your experience using AmbitionBox
Terrible
Terrible
Poor
Poor
Average
Average
Good
Good
Excellent
Excellent