Recently I interviewed at Adobe | Noida
YOE : 3 years 3 months
Round 1 :
Q1 : Merge interval question . How many minimum meeting rooms required to accomodate all the meetings give in 2d array.
For ex :
input => [[0 50] , [5 10], [2 7], [8 20], [30 40]]
output => 3

Q2 : Find a given string in 2d charecters matrix . You can move in all 4 directions up, down, right, left :
Ex : inputs => s = "APPLE" , mat[][] = [['c', 'l', 'u', 'p', 'p', 'l']
['d', 'i', 'j', 'a', 'p', 'e']
['j', 'd', 'u', 'w', 'v', 'x']
['o', 'd', 'u', 'p', 'p', 'e']
['m', 'n', 'x', 'w', 'z', 'q']]
Output --> true (APPLE is present in matrix).

Round 2 :
Q1 : For a binary tree a random node is start burning . Find min time taken to burn all the nodes. (leetcode medium - hard tree question)
Q2 : Implement shared Pointer in c++(smart pointer concepts ). Plus some c++ concepts.

Round 3 : (Manager)
1. Deep discussion on current projects
2. multithreading concepts in c++ /Deadlocks hw to resolve it.
3. Desing patterns Implement Singleton pattern with thread safety.

Round 4 : (Director)
1 . project discussion
2. various behaviral questions.
3. Basic Linked list question

For DSA try to go thru with trees (medium to hard level)

Can somebody answer my following question.
https://leetcode.com/discuss/career/2457159/Adobe-Interview