Adobe | MTS 2 | JAVA | Noida | November 2024 | Interview Experience | Rejected

I interviewed with Adobe for an MTS 2 JAVA role, coming from a Tier 3 college with 2+ years of experience. This was my first time interviewing with the company.

Round 1 (Problem Solving)

This round started with my introduction, followed by questions about my projects at my current company. After that, I was given two coding problems:

1. Tell whether at least two non-overlapping increasing subarrays of length k exist in an array.
2. Find the maximum length of a subarray such that it contains at least two non-overlapping increasing subarrays.

Round 2 (Problem Solving - Java Focus)

This round delved into more specific Java concepts, particularly around concurrency. The interviewer asked several questions about concurrency, multithreading, race conditions, and the reader-writer problem. Following the conceptual questions, I was asked to implement two problems:

1. Implement a concurrent HashMap with get, put, and delete operations.
2. Given a tree where each node has left, right and parent pointers, implement lock() and unlock() methods for a node. The condition for locking a node was that all its ancestor nodes and all its descendant nodes must be unlocked.

Despite my efforts, I was not selected for the role.