Adobe CS-1 Round 1 Coding Questions: 7 Experiences (Part 5 of 12)

Shared by janebeingjane ·
Company
Adobe
Reports
7 interview reports
Level
Full-time
Stages
Phone screen

Adobe CS-1 round 1 reports from Dec 2024 to Aug 2025 show two coding problems per round, with interviewers pushing hard on optimal code and edge cases.

At a glance

  • Process: a coding round, usually two problems (all seven); 24's two rounds were on one day, and 28 coded in an IDE. Later rounds added more coding, LLD or design, and a hiring manager or director (29, 30).
  • Asked recently: trees in 2 of 7 (29, 30), dynamic programming in 2 (26, 29), plus stacks and queues, matrices, greedy intervals and BFS once each. Two rounds added CS fundamentals: C++ memory (26) and databases (28).
  • Difficulty: interviewers pressed for more. Candidate 25 solved both and was still told one wasn't solved and one wasn't optimal; 27 was grilled on edge cases after an optimal answer; 28 needed steady hints on a problem new to them. One of the seven reported an offer, at CS-1 after applying for MTS-2 (30).
  • Practise first: Rain Water Held Between Bars, Most Cash From Non-Neighboring Houses, Build a Queue From Two Stacks and Zigzag Level Order of a Binary Tree.

Coverage: 7 Computer Scientist reports (six CS-1, one with the sub-level not given) from Dec 2024 to Aug 2025, in Noida where a place was given. The series covers 69 experienced-hire reports, first technical round only; later rounds get a short note at the end of each entry.

In this series

What came up

No topic dominated: the seven rounds named 13 different problems. What repeated was the bar, with optimal code and edge cases checked closely.

Topic Reports Last seen
Dynamic programming 2 of 7 Jul 2025 (report date)
CS fundamentals (C++ memory, databases) 2 of 7 Jul 2025 (report date)
Stacks and queues 2 of 7 May 2025 (report date)
Trees 2 of 7 Dec 2024
Arrays and two pointers 1 of 7 Aug 2025 (report date)
O(1) data-structure design 1 of 7 Aug 2025 (report date)
Strings and parsing 1 of 7 Jul 2025 (report date)
Sorting and greedy placement 1 of 7 May 2025 (report date)
Matrices 1 of 7 Apr 2025 (report date)
Greedy intervals 1 of 7 Dec 2024 (report date)
Graphs (BFS) 1 of 7 Dec 2024 (report date)
Hash maps 1 of 7 Dec 2024
Résumé and current work 1 of 7 Dec 2024

Questions we found

Algorithms / Data Structures

Question Reports Last seen
Rain Water Held Between Bars (a variation of LC 42) 1: 27 Aug 2025 (report date)
Long-ID Store Without Hashing: O(1) Get, Add and Delete by ID 1: 27 Aug 2025 (report date)
Most Cash From Non-Neighboring Houses (LeetCode 198) 1: 26 Jul 2025 (report date)
Strict Text to Integer for a Given Size 1: 26 Jul 2025 (report date)
Rebuild the Queue From Taller-in-Front Counts 1: 24 May 2025 (report date)
Longest Properly Closed Bracket Run (LeetCode 32) 1: 24 May 2025 (report date)
Fill an n x n Grid in Spiral Order (LeetCode 59) 1: 25 Apr 2025 (report date)
Build a Queue From Two Stacks (LeetCode 232) 1: 25 Apr 2025 (report date)
Minimum Arrows to Burst Balloons (LeetCode 452) 1: 28 Dec 2024 (report date)
Minutes Until All Oranges Rot (LeetCode 994) 1: 28 Dec 2024 (report date)
Zigzag Level Order of a Binary Tree (LeetCode 103) 1: 29 Dec 2024
Find the Pair With a Target Sum (LeetCode 1) 1: 30 Dec 2024
Mirror a Binary Tree (LeetCode 226), recursive and iterative 1: 30 Dec 2024

Language and CS Fundamentals

Question Reports Last seen
C++: pointer vs reference, stack overflow without recursion, heap memory 1: 26 Jul 2025 (report date)
Databases: SQL vs NoSQL, indexing, sharding, locks, one app on two databases 1: 28 Dec 2024 (report date)

7 Computer Scientist 1 round 1 reports

24: CS-1 from an EDA company: queue by heights, then parentheses

Report date: May 4, 2025 · Role: Computer Scientist 1 · Experience: 4 years · Location: Noida, India · Result: Rejected

Round 1: Coding (first technical round)

  1. A recruiter reached out, and both rounds were on the same day.
  2. Rebuild the queue from taller-in-front counts: n people with unique heights, plus for each person the number of taller people standing ahead. Print the heights in real queue order. Example: heights [5,3,2,6,1,4] with counts [0,1,2,0,3,2] give [5,3,2,1,6,4].
  3. Working code was required. The candidate sorted first, then placed people in an O(n²) pass. The interviewer seemed fine with that complexity.
  4. Longest Valid Parentheses (LC 32). Only the approach was needed here, no code.

After round 1: Round 2 had three problems: kth smallest in a BST, longest substring without repeats, and removing the nth node from the end of a list, done recursively. Nine days later the answer was no.


25: CS-1 rejected despite solving both: spiral matrix and a stack queue

Report date: Apr 5, 2025 · Role: Computer Scientist 1 · Location: Noida, India · Result: Rejected

Round 1 (first technical round)

  1. Fill an n x n matrix in spiral order (LC 59). The interviewer showed the full spiral matrix as the expected print. The candidate built and printed it, and the interviewer said the logic was the same.
  2. Queue using two stacks (LC 232). The candidate first gave a working version. The interviewer wasn't satisfied, so they gave an optimized one.
  3. Recruiter feedback later said the first problem was not solved and the second was not optimized. The candidate was rejected after this round.

26: CS-1 with a late start: C++ memory basics, house robber, strict atoi

Interview date: 2025 (report date Jul 10, 2025) · Role: Computer Scientist 1 · Location: Noida, India · Result: Rejected after round 2, no feedback

Round 1: DSA and C++ fundamentals (first technical round)

  1. The interviewer joined an hour late.
  2. C++ questions: pointer vs reference, what a stack overflow is and whether it can happen without recursion, and what heap memory is.
  3. House Robber (LC 198). The candidate solved it, moving from brute force to memoization to O(1) space.
  4. Strict string to integer: skip leading and trailing spaces. The input is valid only if it is all digits, with an optional leading minus. Return INT_MAX on overflow or bad input. You can't assume the integer is 2 or 4 bytes.
  5. Both were solved. At the end, the interviewer asked the candidate to show their Chrome search history.
  6. The candidate passed.

After round 1: Round 2 was rescheduled four times. It asked for count of smaller numbers after self and container with most water. The candidate used two pointers for the second, but the interviewer pushed for a stack-based answer. A rejection followed with no feedback.


27: CS-1 pressed on edge cases: trapped water and an O(1) ID store

Interview date: 2025 (report date Aug 27, 2025) · Role: Computer Scientist 1 · Result: Pending (the round 3 interviewer never showed up)

Round 1: DSA (first technical round)

  1. A variation of Trapping Rain Water (LC 42). The candidate went from brute force to the optimal answer in about 20 minutes, with a dry run.
  2. The interviewer wasn't satisfied and wanted explicit edge cases. They drilled into a C++ vector size check (v.size() <= 2 versus v.size() - 2 <= 0). The candidate added an explicit check when asked.
  3. Design three APIs that each run in O(1): Get(id), Add(id, name) and Delete(id). The candidate used hashing. The interviewer pushed back that collisions can make it O(n). Practice version: Long-ID Store Without Hashing.
  4. The candidate only moved on after chasing HR.

After round 1: Round 2 asked to reverse the words in a sentence while handling spaces, in O(n), and how to cut latency for a user in India reaching a time server in the USA. The round 3 interviewer did not show up.


28: Computer Scientist: balloons, rotting oranges, a database grilling

Report date: Dec 15, 2024 · Role: Computer Scientist (sub-level not given)

Round 1: DSA (first technical round)

  1. Coding happened in an IDE.
  2. Minimum Arrows to Burst Balloons (LC 452). It was new to the candidate. With steady hints they got close to the logic but were slow, so the interviewer moved on.
  3. Minutes until all oranges rot (LC 994). Solved quickly, explained, and run on the test cases the interviewer asked for.
  4. Databases: SQL vs NoSQL; why indexes exist, how they differ for read-heavy and write-heavy loads, and the data structure behind them; sharding and partitioning; locks and concurrency; and how one app talks to two databases.

After round 1: Round 2 had Majority Element, sorting 0s, 1s and 2s, and questions about Kafka use. Round 3, a design and hiring manager round, was the admin side of e-commerce inventory: add, remove and search products, APIs, sharding and hot keys. The outcome wasn't shared.


29: CS-1 with 4+ years: three ways through one DP, then zigzag

Interview date: Dec 2024 · Role: Computer Scientist 1 (Noida role; candidate based in Bengaluru) · Experience: 4+ years · Result: Not selected after the director round

Round 1: DSA (first technical round)

  1. A recruiter reached out. A Computer Scientist took this round.
  2. A DP problem about maximizing an amount. The candidate didn't recall the exact problem. They coded it three ways: recursion, then tabulation, then memoization. The interviewer asked them to avoid an n x n table and was happy with the approach.
  3. Zigzag level order of a binary tree (LC 103). The code had to work on the first run.
  4. The candidate rated it 9 out of 10, and the feedback was positive.

After round 1: An LLD round with a class diagram and partial code, and a 1.5-hour design round where database and queue choices had to be justified, both got positive feedback. The director round asked about the current company and about academics and marks. The candidate was not selected.


30: Applied for MTS-2, offered CS-1: Two Sum and a mirrored tree

Interview date: Dec 2024 (offer month; report date Dec 11, 2024) · Role: Applied for MTS-2, offered Computer Scientist 1 · Experience: 3.5 years · Location: Noida, India · Result: Offer at CS-1

Before the first technical round: The candidate applied through the careers site with a referral, then had a short recruiter call.

Round 1 (first technical round)

  1. Behavioral questions from the resume about the candidate's current work.
  2. Two Sum (LC 1): find two numbers in an array that add up to a target. The candidate had to pick the best approach on their own.
  3. Mirror a binary tree (LC 226) and print it, both recursively and iteratively.

After round 1: Round 2 was building a hashmap from scratch: hashing, collisions, load factor, rehashing, generics and optimizations. Round 3 asked for a stack with O(1) get, insert and delete for its middle element and a restaurant producer-consumer simulation with race conditions and autoscaling. The last round covered crashes, moving an event-driven system to APIs, querying trains through a station, and why Adobe. The offer came at CS-1, one level above the role applied for.


Patterns across the reports

  1. Solving it is not always enough. Three candidates were pushed past a working answer: 25 had to give an optimized queue and was still marked down, 27 was drilled on a vector-size edge case and on hash collisions, and 26's round-two interviewer wanted a stack-based answer instead of two pointers.

Common questions

How hard is the Adobe CS-1 coding round?

Mostly LeetCode-style mediums, but graded strictly (see the pattern above). Candidates 26 and 29 solved theirs and passed; 29 rated the round 9 out of 10.

Does Adobe ask CS fundamentals in the CS-1 first round?

Sometimes. Candidate 26 had C++ questions on pointers, stack overflow and heap memory, and 28 a long database discussion on indexes, sharding and locks.

Keep practicing

In this series

Sources: Anywhere useful interview info can be found.

Next in this seriesAdobe CS-2 and Senior CS Round 1: 4 Experiences (Part 6 of 12)
0 total reactions. Your reactions: none.

Comments

0

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