Upload Button Icon Add office photos

Adobe

Compare button icon Compare button icon Compare

Filter interviews by

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. 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 ...read more
  • Q3. 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
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 at International Institute of Information Technology (IIIT), Hyderabad 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

asked in Salesforce
Q1. Buy and Sell Stock Problem Statement Imagine you are Harshad Meht ... read more
asked in Salesforce
Q2. Optimal Strategy for a Coin Game You are playing a coin game with ... read more
Q3. Next Smallest Palindrome Problem Statement Find the next smallest ... read more
Q4. Check Permutation Problem Statement Given two strings 'STR1' and ... 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.

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...

  • 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...

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...

  • 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:

    ...
  • Q3. What are Vtable and VPTR in C++?
  • Q4. What are friend functions in C++?
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...

  • 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...

  • 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...

  • Q4. What is memory protection in operating systems?

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

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 Illustrator

 (1)

Interview Preparation Tips

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

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

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

(1 Question)

  • Q1. Asked coding question on array medium level.
Round 2 - Technical 

(1 Question)

  • Q1. Asked design related question and coding question and current project architecture etc
Round 3 - Behavioral 

(1 Question)

  • Q1. Techno behavioural question
Round 4 - HR 

(1 Question)

  • Q1. Salary negotiation

Interview Preparation Tips

Interview preparation tips for other job seekers - PS dsa system design doing properly will help
Interview experience
3
Average
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Campus Placement

Round 1 - Aptitude Test 

All questions cs fundamentals

Round 2 - Coding Test 

Basic coding questions

Round 3 - Technical 

(1 Question)

  • Q1. Technical interview
Round 4 - One-on-one 

(1 Question)

  • Q1. Second technical interview kind of managerial
Round 5 - HR 

(1 Question)

  • Q1. Basic hr questions
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
4-6 weeks
Result
Selected Selected

I applied via Naukri.com and was interviewed before Feb 2023. There were 3 interview rounds.

Round 1 - Technical 

(2 Questions)

  • Q1. Related to Software Testing Process Coding questions Puzzle
  • Q2. How to get individual character from string
  • Ans. 

    Use indexing to access individual characters from a string.

    • Use square brackets and the index number to access a specific character in the string.

    • Remember that indexing starts at 0 in most programming languages.

    • Example: str = 'hello', to get the first character 'h', use str[0].

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

(1 Question)

  • Q1. Coding Questions
Round 3 - One-on-one 

(1 Question)

  • Q1. Managerial round

I applied via Recruitment Consulltant and was interviewed in Nov 2021. There were 5 interview rounds.

Round 1 - Coding Test 

Basic Coding questions around LRU Cache and Top View Tree Traversal

Round 2 - Coding Test 

Multi threading and Internal Working of Hash Map!

Round 3 - HR 

(1 Question)

  • Q1. Behavioural Questions
Round 4 - HR 

(1 Question)

  • Q1. Behavioural Questions
Round 5 - HR 

(1 Question)

  • Q1. Behavioural Questions

Interview Preparation Tips

Topics to prepare for VMware Software Member Technical Staff interview:
  • Data Structures
  • Java
Interview preparation tips for other job seekers - Good knowledge in Java if applying for Java Background and medium level Data Structures knowledge is essential

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

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 109 salaries
₹9.5 L/yr - ₹29.2 L/yr
59% 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

2-5 Yrs

Not Disclosed

Member Technical Staff - 2

Noida

2-7 Yrs

Not Disclosed

Member of Technical Staff - II (C++)

Noida

1-5 Yrs

Not Disclosed

Explore more jobs
Computer Scientist
441 salaries
unlock blur

₹20 L/yr - ₹70.4 L/yr

Technical Consultant
266 salaries
unlock blur

₹13.4 L/yr - ₹30.2 L/yr

Software Engineer
257 salaries
unlock blur

₹8.5 L/yr - ₹28.5 L/yr

Computer Scientist 2
225 salaries
unlock blur

₹28 L/yr - ₹101 L/yr

Senior Technical Consultant
207 salaries
unlock blur

₹15.4 L/yr - ₹46 L/yr

Explore more salaries
Compare Adobe with

Salesforce

4.1
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