adobe logo
Adobe· cs1

Adobe | CS1 | Bangalore | 2022 | Offer | 4.5 YOE

Result
Offer
Location
bangalore
Experience
4.5 years
Posted
9 May 2022
380 reads

Summary

I interviewed at Adobe for a CS1 role in Bangalore with 4.5 years of experience and successfully received an offer. The interview process involved multiple technical and behavioral rounds, covering data structures, algorithms, and system design.

How it went

I recently interviewed for a CS1 position at Adobe in Bangalore. My experience level is 4.5 years of experience, and I'm pleased to share that I received an offer after completing five rounds.

Round 1: Data Structures & Algorithms

This round focused on my problem-solving skills with two coding challenges. I was given the following problems:

Round 2: Data Structures & Algorithms

Similar to the first, this round also consisted of two coding problems designed to test my algorithmic knowledge:

Round 3: System Design

This round delved into system design, specifically revolving around a concurrent systems design problem. While the exact problem statement isn't detailed, the discussion covered the architectural aspects of concurrent systems.

Round 4: Technical & Behavioral

This was a mixed round where I tackled a specific system design question and also engaged in behavioral discussions. The technical challenge involved designing a mobile plugin, which was quite interesting.

Round 5: Behavioral with Director

The final round was a dedicated behavioral interview with a Director, focusing on my past experiences, teamwork, and approach to various situations. Ultimately, I was extended an offer for the CS1 role within the Adobe Creative Cloud team.

Questions asked (4)

  1. 01

    Binary Search Tree to Greater Sum Tree

    Data Structures & Algorithms · Medium

    Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every node's value is changed to the original value plus the sum of all nodes with a greater value.

    Open the problem
  2. 02

    Maximum Points You Can Obtain from Cards

    Data Structures & Algorithms · Medium

    There are several cards arranged in a row, and each card has an associated number of points. The points are given in the integer array cardPoints.
    In one step, you can take one card from the beginning or from the end of the row. You have to take exactly k cards.
    Your score is the sum of the points of the cards you have taken.
    Given the integer array cardPoints and the integer k, return the maximum score you can obtain.

    Open the problem
  3. 03

    Longest Substring with At Most K Distinct Characters

    Data Structures & Algorithms · Medium

    Given a string s and an integer k, return the length of the longest substring of s that contains at most k distinct characters.

    Open the problem
  4. 04

    Design Cricbuzz Mobile Plugin

    System Design

    Design a Cricbuzz mobile plugin that is installed on a mobile device and keeps on fetching the current score of a given match from the Cricbuzz website.

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Adobe recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!