Adobe Computer Scientist Interview Questions, Process, and Tips

Q1. Find left view of binary tree. Two sum problem
Ans. 
Left view of a binary tree is the set of nodes visible when the tree is viewed from the left side.
• Traverse the binary tree level by level using BFS or DFS.

• Keep track of the first node encountered at each level (leftmost node).

• Store the leftmost nodes in an array to get the left view of the binary tree.
Answered by AI
Add your answer
Q2. Three sum follow up question
Add your answer

Q1. Merge K-Sorted Linked List
Ans. 
Merge K-Sorted Linked List
• Create a min heap of size k

• Insert the first element of each linked list into the heap

• Pop the minimum element from the heap and add it to the result list

• Insert the next element from the linked list of the popped element into the heap

• Repeat until all elements are processed
Answered by AI
Add your answer
Q2. Leetcode(139): Word break
Add your answer

Q1. Matrix: given start and end, matrix filled with directions -> to identify if a path possible from start to end
Add your answer
Q2. Insert, delete, get random in O(1) | leetcode(380)
Add your answer

Q1. Design Cache, Basic C++
Add your answer
Q2. Break linkedlist into two lists(positive and negative)
Ans. 
To break a linked list into two lists, we can traverse the list and add nodes to respective lists based on their value.
• Traverse the linked list and add nodes to positive or negative list based on their value

• Create two empty lists for positive and negative nodes

• Iterate through the linked list and add nodes to respective lists

• Join the two lists at the end to get the final result
Answered by AI
Add your answer
Q3. If a subarray exist whose sum = k | leetcode(560)
Ans. 
Given an array of integers, find if a subarray exists whose sum equals to k.
• Use a hashmap to store the prefix sum and its frequency.

• Iterate through the array and check if the difference between current prefix sum and k exists in the hashmap.

• If it exists, then a subarray with sum k exists.

• Time complexity: O(n), Space complexity: O(n).
Answered by AI
Add your answer

Q1. Open ended technical question, related to graph, maths and heap
Add your answer

Q1. Open ended technical question related to strings and search
Add your answer
Q2. 2 - Mathematics puzzles
Add your answer

Q1. What are your salary expectations?
Add your answer
Q2. Share details of your previous job.
Add your answer

Do as much medium level problems from leetcode as possible

Same as round 1

Q1. Get knowledge of advanced c++ topics
Add your answer
Q2. Virtual destructor, inheritance
Add your answer