Adobe CS1 Interviews: 14 Experiences (Part 4 of 6)

Shared by janebeingjane ·
Company
Adobe
Level
Full-time
Stages
Phone screen

Two 2023-24 Adobe Computer Scientist 1 first rounds each had two coding problems (CS1 01 also had a classes question); both candidates were rejected.

At a glance

  • Process: a first technical round of two coding problems (with a senior Computer Scientist in CS1 01, plus a classes question), then a coding round and a hiring manager (CS1 01) or a high-level design round (CS1 02).
  • Asked in these reports: a BST to doubly linked list conversion and a classes question (CS1 01); LeetCode 80 and a pair-sum variant (CS1 02).
  • Difficulty: CS1 02 called both problems LeetCode medium and could not code the optimal one; CS1 01 missed the classes question.
  • Practise first: Turn a BST Into a Sorted Doubly Linked List and Keep At Most Two Copies in a Sorted Array.

Coverage: 14 experienced Computer Scientists at CS1, or with the level not given (four), in Noida and Bengaluru (one gave only India and two no location). Two are current (Dec 2023 and Mar 2024); 12 from 2022 to Oct 2023 sit in History.

In this series

What came up

Only two current reports here, both with two coding problems: a tree-to-list conversion and a recursion problem, after a classes question (CS1 01), and two array problems (CS1 02). Part 1 has the question tables.

2 detailed candidate timelines, loops, and screens

CS1 01: a BST turned into a list

Report date: Mar 2024 · Role: CS1 · Location: Noida · Result: Rejected

Round 1 with a senior Computer Scientist

  1. A classes-and-objects question the candidate could not finish.
  2. Convert a binary search tree into a sorted doubly linked list; done in time (Turn a BST Into a Sorted Doubly Linked List).
  3. A recursion problem the candidate has since forgotten (they think it was LeetCode medium); also done.

Later rounds

  1. With a CS2 who wanted the fewest variables and lines: a k-th largest value in a BST variant, rotting oranges, and set versus map.
  2. Hiring manager (day 2): a monkey flipping doors between two points, to be modelled with classes; flipping the bits between two indices; counting larger values to the right.

CS1 02: duplicates in a sorted array

Interview date: Dec 2023 · Role: CS-1 (4.5 years) · Result: Rejected

Round 1: two LeetCode mediums

  1. LeetCode 80, keep at most two copies of each value in a sorted array. The candidate could not code the optimal version. See Keep At Most Two Copies in a Sorted Array.
  2. A variant of pair sum (not described).

Round 2 (high-level design): a lock that pauses requests and scheduled jobs while one user's data moves between data centres, and why SQL indexes use B-trees rather than hashing. The rejection followed this round.


History (before Nov 2023)

Twelve Computer Scientist reports from 2022 to Oct 2023 follow, newest first.

CS1 H01: seven questions in eighty minutes

Report date: Oct 2023 · Role: CS 1 (3 years) · Location: Noida · Result: Rejected the same day

  1. A one-hour slot that ran to 1 hour 20: explain and code a singleton; LeetCode 33 (Search a Rotated Sorted Array); critical sections and keeping them consistent; pagination; process versus thread; print the path between two nodes of a tree, coded two ways (Path Between Two Nodes of a Binary Tree).

CS1 H02: rate limiting and the k-th largest

Report date: Sep 2023 · Role: CS-1 · Location: Noida · Result: Rejected right after round 1

  1. One hour: denial of service and rate-limiting algorithms; a short maths question; LeetCode 215, naive first and then with a heap (K-th Largest Value in an Array); the eight-balls puzzle.

CS1 H03: one jump problem for the whole hour

Interview date: Sep 2022 · Role: CS1 · Location: Noida · Result: Not shortlisted

  1. LeetCode 45, the fewest jumps to the end (Fewest Jumps to the End or Stuck). The candidate went from backtracking to an O(n²) DP; the interviewer twice asked for something better, which the candidate did not reach.

CS1 H04: lighting a street of bulbs

Interview date: Jul 2022 · Role: Computer Scientist · Location: Noida · Result: Rejected

  1. Round 1: a street such as [0,1,0,0,1,0,0,1], where each working bulb (1) lights k steps each way. Can the whole street be lit, and with the fewest bulbs switched on? (Light the Whole Street With Fewest Bulbs)
  2. Round 2: an LRU cache with O(1) operations.

CS1 H05: a sum tree, two ways

Report date: May 2022 · Role: CS1, C++ (6.5 years) · Location: Noida · Result: Offer

  1. Round 1: check a sum tree top-down and bottom-up and compare them (Check Whether a Tree Is a Sum Tree); a set with O(1) insert, delete and get-random; stack corruption and heap versus stack.
  2. Later: the largest single-value subtree, virtual memory, the process control block, static allocation, the this pointer and a puzzle; memory leaks and dangling or wild pointers, the best sum of non-adjacent values, the shortest string holding all words in order and another puzzle; a string tokenizer (next token, n tokens, the n-th token, reset) and behavioral questions.

CS1 H06: islands and tree width

Interview date: May 2022 · Role: Computer Scientist, Creative Cloud · Location: Bengaluru · Result: Rejected after the director round

  1. Round 1, both solved in time: LeetCode 200 (Count the Islands) and LeetCode 662 (Widest Level of a Binary Tree).
  2. Later: a home-made shared pointer and House Robber; overlapping rectangles in extensible code; a paint app design.

CS1 H07: rotting oranges and a greater-sum tree

Interview date: 2022 (report date May 2022) · Role: CS1, Creative Cloud (4.5 years) · Location: Bengaluru · Result: Offer

  1. Round 1: LeetCode 994 (Minutes Until All Oranges Rot) and LeetCode 1038 (Add All Larger Values in a BST).
  2. Later: LeetCode 1423 and LeetCode 340 (Longest Stretch With At Most K Different Letters); a concurrency design; a live cricket-score plugin and behavioral questions; a behavioral round with the director.

CS1 H08: anagrams and intervals

Report date: Apr 2022 · Role: CS1 (4.8 years) · Result: Rejected

  1. Round 1: LeetCode 49 (Group Words by Their Letters) and LeetCode 56 (Merge Overlapping Intervals).
  2. Later: LeetCode 4; a thread-safe client-side rate limiter with tests; with the hiring manager, past work, concurrency with binary semaphores and mutexes, an unbounded linear search that may not use try/catch, and behavioral questions on handling conflict, what your manager would say about you and how you would react to too little credit for your work.

CS1 H09: good nodes and islands

Interview date: Mar 2022 · Role: Computer Scientist, Java · Location: India · Result: Pending when posted

  1. Round 1: LeetCode 1448 (Count Nodes That Top Their Root Path), LeetCode 200 (Count the Islands) and the candidate's project architecture.
  2. Round 2: an infection-spread grid, LeetCode 1038, a dice from a coin and a database choice; only the BST one was solved.

CS1 H10: a loop check and a chess model

Report date: Mar 2022 · Role: CS-1, Illustrator (C++) · Location: Bengaluru · Result: Offer

  1. Round 1: detect a loop in a linked list; is a linked list of letters a palindrome (Is the Linked List a Palindrome); a singleton; a chess game's classes (Design a Chess Move Validation Model).
  2. Later: a garbage collector for C/C++; a singleton that hands out two instances in turn, vtables and vptrs, operator overloading and copying a list with random pointers; a fast memcpy, a recursive list reversal and an iterative inorder walk, after questions on the current role and behavior; why switch jobs.

CS1 H11: zero-sum subarrays

Report date: Feb 2022 · Role: Computer Scientist (4 years) · Location: Bengaluru · Result: Pending when posted

  1. Round 1: does any subarray sum to zero, and how long is the longest one (Zero-Sum Subarray: Exists and Longest).
  2. Later: a parking lot with concurrent slot assignment; a project deep dive, LeetCode 45 greedy and LeetCode 845.

CS1 H12: two named LeetCode problems

Interview date: Jan 2022 · Role: CS1 · Location: Noida · Result: Not disclosed

  1. Round 1: LeetCode 1537 (Best Score Switching Between Two Sorted Arrays) and LeetCode 198 (Most Cash From Non-Neighboring Houses).
  2. Later: LeetCode 160 (First Node Two Linked Lists Share), LeetCode 138 and LeetCode 37.

Keep practicing

In this series

Sources: Anywhere useful interview info can be found.

Next in this seriesAdobe CS2 and Senior CS Interviews: 6 Experiences (Part 5 of 6)
0 total reactions. Your reactions: none.

Comments

0

No comments yet — be the first to share what you know.