Adobe Software Developer Interview Questions, Process, and Tips

2medium level questions

Q1. Project discussion for 30 mins
Add your answer
Q2. Dsa problem medium level
Add your answer

Leet code questions. Basic Questions was easy

Q1. Give an array of integers arr1, find a new array where array[i] = multiplication of all entries arr1 except arr1[i] without using division operator
Ans. 
To find a new array where each element is the product of all elements in the original array except the element at that index without using division operator.
• Iterate through the array and calculate the product of all elements to the left of the current index for each element.

• Iterate through the array in reverse and calculate the product of all elements to the right of the current index for each element.

• Multiply the resu...read more
Answered by AI
Add your answer
Q2. Given a wholly sorted two dimensional array , find the index of given element or return -1 if not present
Ans. 
Search for an element in a sorted 2D array and return its index if found
• Start from the top right corner and compare the target element with the current element

• If the target is smaller, move left; if larger, move down

• Repeat until the element is found or all elements are checked
Answered by AI
Add your answer

Basic maths , physics and core subjects and e.t.c

Basic coding array, strings , linked list , stack , queue

Binary search tree algorithm based questions

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 questions of DSA . Both the questions were from Linked Lists. I was first asked to explain my approach and then code up the both the problems.

Q1. 
Delete the Middle Node from a Singly Linked List
Given a singly linked list of integers, the task is to remove the middle node from this list.
Input:
The first line of input includes an integer 'T' whic...read more
Ans. 
The task is to delete the middle node of a singly linked list of integers.
• If the linked list is empty or has only one node, there is no middle node to delete.

• To delete the middle node, we need to find the middle node and update the pointers of the previous and next nodes.

• To find the middle node in one traversal, we can use two pointers - a slow pointer and a fast pointer.

• The slow pointer moves one node at a time, while...read more
Answered by AI
Add your answer
Q2. 
Merge Two Sorted Linked Lists Problem Statement
You are provided with two sorted linked lists. Your task is to merge them into a single sorted linked list and return the head of the combined linked list.
...read more
Ans. 
The task is to merge two sorted linked lists into a single sorted linked list.
• Create a new linked list to store the merged list

• Compare the values of the nodes from both lists and add the smaller value to the new list

• Move the pointer of the list with the smaller value to the next node

• Repeat the comparison and addition until one of the lists is empty

• Add the remaining nodes from the non-empty list to the new list

• Return th
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

This round had 2 coding questions , the first one was related to Sorting and the second one was related to Compilers and C++ in general to check endianess of the machine actually . After the coding questions, I was asked some concepts related to OOPS in general.

Q1. 
Sub Sort Problem Statement
You are given an integer array ARR. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in a...read more
Ans. 
The task is to find the length of the shortest contiguous subarray that needs to be sorted in order to sort the entire array.
• Iterate through the array from left to right and find the first element that is out of order.

• Iterate through the array from right to left and find the first element that is out of order.

• Find the minimum and maximum elements within the subarray defined by the above two elements.

• Expand the subarray...read more
Answered by AI
Add your answer
Q2. 
Swap Adjacent Bit Pairs Problem Statement
Given an integer N, your task is to compute the number that results from swapping each even position bit of N's binary representation with its adjacent odd bit to...read more
Ans. 
The task is to swap each even bit of an integer with its adjacent bit on the right in its binary representation.
• Convert the given integer to its binary representation

• Iterate through the binary representation and swap each even bit with its adjacent bit on the right

• Convert the modified binary representation back to an integer

• Print the resulting integer
Answered by AI
Add your answer
Q3. What are virtual destructors in C++?
Ans. 
Virtual destructors in C++ are used to ensure that the correct destructor is called when deleting an object through a pointer to its base class.
• Virtual destructors are declared in the base class and are used when deleting an object through a pointer to the base class.

• They allow proper destruction of derived class objects.

• Without virtual destructors, only the base class destructor would be called, leading to memory leak...read more
Answered by AI
Add your answer

Round duration - 50 Minutes
Round difficulty - Medium

Standard DS/Algo round with 2 questions . First I explained my approach and then we discussed some Edge Cases along with proper Complexity Analysis.

Q1. 
Problem: Search In Rotated Sorted Array
Given a sorted array that has been rotated clockwise by an unknown amount, you need to answer Q queries. Each query is represented by an integer Q[i], and you must ...read more
Ans. 
This is a problem where a sorted array is rotated and we need to search for given numbers in the array.
• The array is rotated clockwise by an unknown amount.

• We need to perform binary search to find the index of the given numbers.

• If the number is found, return its index. Otherwise, return -1.

• The time complexity of the solution should be O(logN).
Answered by AI
Add your answer
Q2. 
Quick Sort Problem Statement
You are provided with an array of integers. The task is to sort the array in ascending order using the quick sort algorithm.
Quick sort is a divide-and-conquer algorithm. It ...read more
Ans. 
The question asks to implement quick sort algorithm to sort an array of integers in ascending order.
• Quick sort is a divide and conquer algorithm

• Choose a pivot point and partition the array into two parts

• Recursively sort the left and right parts of the array

• Implement the quick sort algorithm to sort the given array
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

This round went for about 50-60 minutes where I had to code two questions related to DSA after discussing their approaches and time and space complexities and then I was asked some questions revolving around OOPS and OS . The interviewer was quite freindly and helped me at some places where I was facing some difficulties.

Q1. 
LCA in a Binary Search Tree
You are given a binary search tree (BST) containing N nodes. Additionally, you have references to two nodes, P and Q, within this BST.
Your task is to determine the Lowest Com...read more
Ans. 
The task is to find the lowest common ancestor (LCA) of two given nodes in a binary search tree (BST).
• The LCA is the lowest node that has both given nodes as descendants.

• In a BST, the left subtree of a node contains only nodes with data less than the node's data, and the right subtree contains only nodes with data greater than the node's data.

• Start from the root node and compare it with the given nodes. If both nodes a...read more
Answered by AI
Add your answer
Q2. 
Spiral Matrix Problem Statement
You are given a N x M matrix of integers. Your task is to return the spiral path of the matrix elements.
Input
The first line contains an integer 'T' which denotes the nu...read more
Ans. 
The task is to return the spiral path of a given matrix.
• Iterate through the matrix in a spiral pattern, starting from the outermost layer and moving towards the center.

• Keep track of the current row, column, and the boundaries of the remaining unvisited matrix.

• Print the elements in the spiral path as you traverse the matrix.
Answered by AI
Add your answer
Q3. What is the Diamond Problem in C++ and how can it be resolved?
Ans. 
The Diamond Problem is a conflict that occurs when a class inherits from two classes that have a common base class.
• The Diamond Problem arises in multiple inheritance.

• It occurs when a class inherits from two classes that have a common base class.

• This leads to ambiguity in accessing the common base class members.

• To fix the Diamond Problem, virtual inheritance is used.

• Virtual inheritance ensures that only one instance of
Answered by AI
Add your answer
Q4. What are the different types of semaphores?
Ans. 
Semaphores are synchronization primitives used in operating systems to control access to shared resources.
• Binary semaphore: Can take only two values, 0 and 1. Used for mutual exclusion.

• Counting semaphore: Can take any non-negative integer value. Used for resource allocation.

• Mutex semaphore: A binary semaphore used for mutual exclusion.

• Named semaphore: A semaphore that can be accessed by multiple processes.

• Unnamed semap...read more
Answered by AI
Add your answer