Adobe Interview Questions Experienced

Adobe Tech Interview Questions

Here’s a list of common Adobe interview questions to get you started on your tech interview prep:

  • Find the minimum spanning tree of a connected, undirected graph with weighted edges.
  • Given a set of candidate numbers ‘C’ and a target number ‘T,’ find all unique combinations in C where the sum of candidate numbers is T.Â
  • Given a singly linked list of ‘N’ nodes, find the middle node of the linked list. If the number of nodes is even, there will be two middle nodes. Print the second node.
  • You’re given the head pointers of two linked lists. Each linked list represents an integer number, with each node is a digit. Your task is to add them and return the resulting linked list.
  • You’re given a binary tree. Your task is to find if it’s a binary search tree.Â
  • Given a dictionary of words and an input string, find whether the input string can be completely segmented into dictionary words.
  • Given an array of positive numbers and a positive number ‘a’, find the maximum sum of any contiguous subarray of size ‘k.’
  • Given an input string, find if it makes a valid number. Assume white spaces are not present.
  • You’re given a list of intervals. Your task is to merge all the overlapping intervals to produce a list that contains mutually exclusive intervals only.
  • How will you print a list of all unique words from a string which may contain repeated words?
  • Implement a 2D bit-matrix representing monochrome pixels that will have only off/on values and take, on average, one bit of memory for each stored bit. How do you perform various operations on it?
  • You’re given a linked list. Your task is to create a deep copy of the given linked list such that any operation like inserting, modifying, and removing will not affect the copied list.
  • Write a function that takes an integer and returns the number of 1 bits it has.
  • Write a program that efficiently counts the total set bits in a number.
  • Write a program that calculates the nth term of a Fibonacci series.
  • What is the best data structure and algorithm to implement cache?
  • Write a program to find the height of a binary tree. What is its complexity?
  • Write a program to search or find the position of a given key in a 2D matrix. All rows and columns are sorted.
  • You’re given an array containing ‘N’ distinct numbers taken from the range 0 to N. For an array with only N numbers out of a total of N+1 numbers, find the missing number.
  • You’re given a sorted and rotated array ‘a’ of ‘n’ distinct elements, which is rotated at some point, and an element key. Find the index of the given element key in the array ‘a’.Â
  • HR Interview

    During this round, you’ll be evaluated on your core values and your work dynamics through behavioral and situational questions.Â

    Adobe Tech Interview FAQs

    Q. What is the Adobe technical assessment?The Adobe technical assessment tests a candidate’s quantitative, verbal, analytical, and coding skills.

    Q. How long does the interview process last at Adobe?Adobe’s interview process lasts for approximately 1.5 months.

    Q. What is unique about Adobe?

  • Adobe provides educational reimbursement of $10,000 a year.
  • You can purchase Adobe Stock at 15% below market value by enrolling in ESPP.
  • Adobe products are free for use by its employees; the company also provides friends and family discounts.
  • explain virtual functions, explain volatile keyword, code iterator of a class, code singleton class, inheritance types, examples, explain copy constructor, explain semaphores, explain constructor initializer list

    c)-> print level order traversal of a tree with each level printing in a new line.

    c)-> detect loop in a linked list. solved it using standard tortoise-hair algorithm. One good variation he asked why are you moving your fast pointer by two and not three. This was a nice variation. I couldn’t tell. think on it?

    b)-> you have integers stored in 1 GB of disk space. and you have to sort it using 100 MB of RAM. how will you do it?

    a)-> given an integer array, consisting of positive and negative values, find the contiguous subarray start and end indices which contain the max sum.

    Adobe Interview Preparation Strategies

    Related Posts

    Leave a Reply

    Your email address will not be published. Required fields are marked *