Adobe | CS1 | Bangalore | 2022 | Offer | 4.5 YOE
- Result
- Offer
- Location
- bangalore
- Experience
- 4.5 years
- Posted
- 9 May 2022
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)
- 01
Binary Search Tree to Greater Sum Tree
Data Structures & Algorithms · Medium
Open the problemGiven the
rootof 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. - 02
Maximum Points You Can Obtain from Cards
Data Structures & Algorithms · Medium
Open the problemThere 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 exactlykcards.
Your score is the sum of the points of the cards you have taken.
Given the integer arraycardPointsand the integerk, return the maximum score you can obtain. - 03
Longest Substring with At Most K Distinct Characters
Data Structures & Algorithms · Medium
Open the problemGiven a string
sand an integerk, return the length of the longest substring ofsthat contains at mostkdistinct characters. - 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.