I recently interviewed at the Adobe, Noida office and received an offer. I had 1 year of work experience.

It was a standard process comprising an aptitude and technical test on HackerRank. You can review past archives for examples of the test.

Screening:

• Aptitude Test
• Technical Test (13 MCQs and 7 standard coding questions)

Interviews at Noida Office:

Round 1: The interview began with a general introduction. The interviewer wanted to gauge my in-depth knowledge of my work, so they asked various questions related to technologies, their usage, and alternative choices.

Questions Related to C, C++:

• How are .h files loaded and linked with their .c files? I admitted I didn't know much about this, as my experience is in Java, and I provided the equivalent answer in Java.
• How to find the minimum element in a rotated array (e.g., 4 5 6 1 2 3)? I answered using Binary Search.
• How to find a common node between two Linked Lists? 1→2→3→4→NULL | 5→6 I provided an answer using the difference in Linked List lengths and wrote code that handled all cases.

Then, we discussed Operating System concepts, Virtual Memory, Paging, etc.

Note: Make sure your code handles all test cases, especially boundary ones.

Round 2: The interview started with a brief introduction. This time, the interviewer was more interested in my hobbies and passions. They asked what I do to stay updated with the latest technology trends.

After that, they asked only one question related to geometry: Given an isosceles right-angled triangle, find the radius of the smaller circle. I1 I solved it using basic Pythagorean theorem.

It was unusual that only one question was asked.

Round 3: This round was tricky.

The interviewer asked me what had been asked so far. I confidently mentioned that I liked the geometry question. I shouldn't have said that...

The question: Given a rectangle ABCD with length l and breadth b, it is folded along the diagonal BD (i.e., A is joined to C). Find the length of the line segment EF. q2 I solved the question with hints. It involved deductions based on visualization and the Pythagorean theorem. Essentially, AE = EC and EF = EC. After that, it was a simple geometry problem.

• How do you heapify an array? What is the time complexity involved? Apparently, they were interested in the exact complexity. I stated that we start heapifying from the last parent whose index in the array is (n-1)/2. They then inquired about how individual elements are heapified and how heap sort works.

Essentially, they wanted me to explain that we don't heapify elements from (n-1)/2 to n, which reduces the time complexity from O(n log n), a point I eventually made.

int a = 8; char *b = (int *) a; Where does b point to?

This question related to Big Endian and Little Endian architectures; they wanted me to ask about the architecture. I admitted I didn't know.

After this, I mentioned my background is in Mechanical Engineering and that I don't know much about computer architecture. The interviewer seemed surprised and skipped the OS questions. Lucky me!!!

• How to determine if a number is a power of 2 in O(1)? n & (n - 1) == 0 ? true : false
• Given an array where all numbers except one are repeated, find the non-repeated number. I provided the algorithm using XOR.

They extended the previous question to finding if two numbers were non-repeated. They wanted the XOR approach again.

• Given two binary trees A and B, check if B is a subtree of A. I solved this using normal tree traversal.
• Find the kth smallest element in an unsorted array of numbers. I first suggested an approach using a min-heap: insert all array elements into a min-heap and extract k times. However, they were interested in a better approach.

I then answered using a Quick Select algorithm (modified QuickSort).

They mentioned a more optimized approach for pivot selection using order statistics. I was unfamiliar with the order statistics method but was satisfied with the basic Quick Select algorithm.

Round 4: Director Round My brief introduction. Questions about my low CGPA, etc.

• Given an array of size m with n allocated indices, how do you minimize the number of comparisons when searching for an element? I wrote basic linear search code. Then, they asked how to minimize comparisons.

• Given n points in a plane forming a polygon, determine if a random point exists inside that polygon.

• How would you find the volume of a lake? They were interested in my approach. I gave 2-3 methods, one of which was quite humorous, and they laughed.

In the end, they asked if I had any questions regarding the role.

I would like to thank GeeksforGeeks for their help in my interview preparation. Cheers!

All Practice Problems for Adobe !

Are you feeling lost in OS, DBMS, CN, SQL, and DSA chaos? Our Complete Inter

I recently interviewed at the Adobe, Noida office and received an offer. I have one year of work experience.

It was a standard process, comprising an aptitude and technical test on HackerRank. This is typical. You can refer to previous archives for similar tests.

Screening

• Aptitude Test
• Technical Test: 13 MCQs and 7 standard coding questions.

Interviews at Noida Office

Round 1 The interview started with my general introduction. The interviewer wanted to assess my in-depth knowledge of my work, so he asked various questions related to technologies, their usage, and the rationale behind choosing them.

• Questions Related to C, C++: How are .h files loaded and linked with their .c files? I was unfamiliar with this aspect as my experience is in Java, so I provided the equivalent answer in Java.
• How to find the minimum element in a rotated array? (e.g., 4 5 6 1 2 3) I provided the solution using Binary Search.
• How to find a common node between two Linked Lists? (Example: 1→2→3→4→NULL, with a branch from 3 to 5→6) I explained the approach using the difference in linked list lengths and wrote code that handled all cases.

Then, we discussed Operating System concepts such as Virtual Memory and Paging.

Note: Ensure your code handles all test cases, especially boundary conditions.

Round 2 The interview began with a brief introduction. This time, the interviewer was more interested in my hobbies and passions. He asked me what I do to stay updated with the latest technology trends.

After that, he posed a single geometry question: Given an isosceles right-angled triangle, find the radius of the smaller circle. I solved it using basic Pythagoras theorem.

It was unusual that he asked only one question.

Round 3 This round was tricky.

The interviewer asked me what had been asked previously. I confidently mentioned that I enjoyed the geometry question. I shouldn't have said that...

The question involved a rectangle ABCD with length 'l' and breadth 'b'. The rectangle was folded along the diagonal BD, effectively joining A to C. The task was to find the length of the line segment EF. I solved the question with hints, which essentially involved deductions, visualization, and the Pythagorean theorem. The key realization was that AE = EC and EF = EC, making it a straightforward geometry problem afterward.

• How do you heapify an array? What is the time complexity involved? He was interested in the precise complexity. I stated that we start heapifying from the last parent, whose index is (n-1)/2. He then inquired about heapifying individual elements and how heap sort works. Essentially, he wanted me to explain that heapifying elements from (n-1)/2 down to n decreases the time complexity from O(n log n), which I eventually articulated.

• int a = 8; char *b = (int *) a; Where does 'b' point to? This question related to Big Endian and Little Endian architectures. I admitted I didn't know about this.

Following this, I mentioned my Mechanical background and limited knowledge of computer architecture. He seemed a bit surprised and skipped the OS questions. I was fortunate!

• How to determine if a number is a power of 2 in O(1)? (n & (n - 1)) == 0? true : false.
• Given an array of numbers with only one non-repeated element and all others repeated, find the non-repeated number. I provided the algorithm using XOR.
• He extended the previous question to find two non-repeated numbers, again expecting the XOR approach.
• Given two binary trees A and B, check if B is a subtree of A. Solved using normal tree traversal.
• Find the kth smallest element in an unsorted array. Initially, I suggested using a min-heap: insert all array elements into a min-heap and extract 'k' times. However, he sought a more efficient solution.

I then presented the quick select algorithm (a modified quicksort). He mentioned that a more optimized approach exists for pivot selection using order statistics, which I was unaware of. However, he was satisfied with the basic quick select algorithm.

Round 4: Director Round

• My brief introduction. Questions about my low CGPA.
• Given an array of size 'm' with 'n' allocated indices, how do you minimize the number of comparisons when searching for an element? I wrote basic linear search code and then discussed how to minimize comparisons.
• Given 'n' points in a plane forming a polygon, determine if a random point exists inside that polygon.
• How would you find the volume of a lake? He was interested in my approach and I provided 2-3 methods, one of which was amusing and made him laugh.

In the end, he asked if I had any questions regarding the role and other aspects.

I would like to thank GeeksforGeeks for their invaluable assistance in my interview preparation. Cheers!