Adobe

Adobe is a global leader in digital media and marketing solutions, best known for products like Photoshop, Illustrator, Acrobat, and Adobe Experience Cloud. In India, Adobe is highly sought after for its engineering, research, and product roles, with a reputation for innovation, employee well-being, and a strong engineering culture.

Eligibility Criteria

Degree: B.Tech/B.E./M.Tech/MCA in Computer Science, IT, ECE, EE, or related fields
Batch: Final year students and recent graduates (within 1 year)
Academic Record: Good academic standing (typically 7.0+ CGPA or 70% in most top colleges)
Backlogs: No active backlogs at the time of application
Other: Strong coding, problem-solving, and communication skills

Note: Adobe may not have a universal cutoff, but top colleges may enforce their own. Off-campus, a strong resume and coding profile are key.

Adobe Placement Process (2024-2025)

The process may vary by campus, but typically includes:

Online Coding Round (on platforms like HackerRank, Codility, or Mettl):
- 3-4 coding questions (DSA, algorithms)
- 60-90 minutes
- May include MCQs on CS fundamentals, aptitude, and output prediction
Technical Interviews (2-3 rounds):
- Data structures, algorithms, OOP, DBMS, OS, and project discussion
- Coding on whiteboard or shared doc
- May include puzzles and system design (for SDE2+)
Managerial/Team Fit Round:
- Problem-solving, design, and behavioral questions
- Deep dive into projects/internships
- Scenario-based and situational questions
HR/Behavioral Interview:
- Motivation, teamwork, leadership, company fit
- Compensation, relocation, and benefits discussion

Sample Coding Questions (Recent Adobe Papers)

1. Remove Duplicates from Sorted Array Given a sorted array, remove the duplicates in-place such that each element appears only once and return the new length.

int removeDuplicates(vector<int>& nums) {
    if (nums.empty()) return 0;
    int i = 0;
    for (int j = 1; j < nums.size(); ++j) {
        if (nums[j] != nums[i]) {
            ++i;
            nums[i] = nums[j];
        }
    }
    return i + 1;
}

2. Valid Parentheses

def isValid(s):
    stack = []
    mapping = {')': '(', '}': '{', ']': '['}
    for char in s:
        if char in mapping.values():
            stack.append(char)
        elif char in mapping:
            if not stack or mapping[char] != stack.pop():
                return False
        else:
            return False
    return not stack

1. Subarray Sum Equals K

def subarraySum(nums, k):
    count = 0
    curr_sum = 0
    d = {0: 1}
    for num in nums:
        curr_sum += num
        count += d.get(curr_sum - k, 0)
        d[curr_sum] = d.get(curr_sum, 0) + 1
    return count

2. Clone a Linked List with Random Pointer

Node* copyRandomList(Node* head) {
    unordered_map<Node*, Node*> m;
    Node* curr = head;
    while (curr) {
        m[curr] = new Node(curr->val);
        curr = curr->next;
    }
    curr = head;
    while (curr) {
        m[curr]->next = m[curr->next];
        m[curr]->random = m[curr->random];
        curr = curr->next;
    }
    return m[head];
}

1. Maximum Rectangle in Binary Matrix Given a 2D binary matrix filled with 0’s and 1’s, find the largest rectangle containing only 1’s and return its area.

2. LRU Cache Implementation

class LRUCache:
    def __init__(self, capacity: int):
        self.cache = collections.OrderedDict()
        self.capacity = capacity
    def get(self, key: int) -> int:
        if key not in self.cache:
            return -1
        self.cache.move_to_end(key)
        return self.cache[key]
    def put(self, key: int, value: int) -> None:
        if key in self.cache:
            self.cache.move_to_end(key)
        self.cache[key] = value
        if len(self.cache) > self.capacity:
            self.cache.popitem(last=False)

Technical Interview Topics

Data Structures & Algorithms (arrays, strings, trees, graphs, DP)
OOP concepts (inheritance, polymorphism, encapsulation)
System Design (for SDE2+ or advanced roles)
DBMS, OS, Networking basics
Coding best practices, code optimization
Projects and internships (deep dive)

HR & Behavioral Interview

Why Adobe?
Tell me about a time you solved a tough problem
Teamwork, leadership, conflict resolution
Scenario-based questions (e.g., “What would you do if…”)
Willingness to relocate, work in diverse teams

Tips for Adobe Placement

Practice coding on LeetCode, HackerRank, Codeforces (focus on DSA)
Review CS fundamentals (OOP, DBMS, OS)
Prepare to discuss your projects in detail
Mock interviews help (especially for system design)
Be clear, concise, and communicate your thought process
Stay calm and ask clarifying questions in interviews

Compensation & Growth

Intern (SDE): ₹1.0–1.2 lakh/month stipend
Full-time SDE: ₹35–45 LPA (CTC, including base, bonus, stock)
Growth: Fast-paced, global opportunities, mentorship, and learning

Resources

Last updated: June 2024