Adobe Product Intern Interviews: 15 Experiences (Part 3 of 4)

Shared by janebeingjane ·
Company
Adobe
Level
Internship
Stages
Phone screen

Five Adobe Product Intern reports, dated Dec 2023 to Jan 2025, show a single interview with one to four coding problems, projects and CS basics.

At a glance

  • Process: an online test where reported (PI 01, PI 02, PI 03, PI 05), then one interview. PI 01 to PI 04 opened with projects or the resume and PI 05 with coding; PI 02's lasted about 50 minutes, PI 05's about an hour, and PI 04's was by phone.
  • Asked in these reports: four problems on a shared editor (PI 01), LeetCode 485 and a tree's longest path (PI 02), a circular-list question and House Robber (PI 03), a fair die from a two-sided toss (PI 04), and two unnamed problems, one array and one DP (PI 05).
  • Difficulty: PI 05 called both its problems medium, PI 02 found LeetCode 485 straightforward (about two minutes) and PI 03 found House Robber the harder of its two. PI 01's bracket problem passed 12 of 15 tests after a hint.
  • Practise first: Diameter of a Binary Tree, Fewest Swaps to Balance Brackets and Most Cash From Non-Neighboring Houses.

Coverage: 15 Product Intern candidates, in India wherever a place is given, including the women-only SheCodes programme. Five are current (Dec 2023 to Aug 2024, plus PI 05, reported Jan 2025 for a May to Aug 2024 internship); 10 sit in History (Mar 2021 to Sep 2023).

In this series

What came up

Four of the five current interviews opened with projects or the resume (PI 01 to PI 04); PI 05 started with coding, then the past internship and OS and DBMS questions. Three moved to array, list and tree coding (PI 01, PI 02, PI 03), one to a probability coding task (PI 04), and PI 05 had one array and one DP problem. Part 1 has the question tables.

5 detailed candidate timelines, loops, and screens

Newest first by the date shown, except PI 05: its Jan 2025 report date comes long after an interview held before its May to Aug 2024 internship, so it goes last.

PI 01: four problems in one interview

Interview date: 2024 (report date Aug 2024) · Role: Product Intern (on campus) · Result: Selected

  1. Online test: two coding problems and 30 multiple-choice questions on C, DBMS and OOP; the candidate's full passes came in the last five minutes.
  2. Interview: projects first. A deployed demo would not load for about five minutes, and the interviewer told the candidate to relax. Then four problems on a shared editor with built-in tests:
  3. Asked for feedback, the interviewer said they liked the candidate's energy about projects.

PI 02: a 50-minute single round

Interview date: 2024 (report date Aug 2024) · Role: Product Intern (on campus) · Result: Selected two days later

  1. Online test: medium DSA problems and multiple-choice questions on DSA and OOP; 35 candidates moved on to the interview.
  2. About 20 minutes on a web project.
  3. LeetCode 485, which the candidate found straightforward, solved in about two minutes with a dry run and edge cases (Longest Run of Ones).
  4. Asked for a favourite data structure (arrays), then the most nodes on any path in a binary tree. Brute force first, then an optimised version with fixed edge cases. The practice version counts edges rather than nodes (Diameter of a Binary Tree).
  5. Why Adobe.

PI 03: a hackathon story and House Robber

Report date: Jun 2024 · Role: Product Intern · Result: Not selected

  1. Online test: aptitude plus two coding problems.
  2. Technical interview: a long resume walk-through; OOP, DBMS and networking; a hackathon the candidate joined and its challenges; a circular linked list question; and the robber who cannot take from two neighbouring houses, the harder of the two problems for the candidate (Most Cash From Non-Neighboring Houses).

PI 04: a fair die from a two-sided toss

Report date: Dec 2023 · Role: Product Intern · Location: Noida or Bengaluru · Result: Offer

  1. A phone interview: a project and CS basics, then coding in the candidate's own editor.
  2. toss() returns 1 or 2 with equal chance. Write dice() that returns a fair 1 to 6 with no built-in random function, then roll it 1,000 times and count each face. Follow-ups covered the code flow and how the compiler treats static, const and normal variables. The candidate's later write-up builds a 3-bit number from three tosses and retries on 0 and 7.

PI 05: two problems the candidate kept private

Report date: Jan 2025 (internship May to Aug 2024; interview date not given) · Role: Product Intern (tech, on campus) · Result: Offer

  1. Online test: two coding problems and multiple-choice questions, many of them on probability and statistics.
  2. One interview of about an hour: about 35 minutes on two medium problems (one array, one DP) that the candidate chose not to share, then the past internship and OS and DBMS topics such as race conditions, semaphores, paging, segmentation and indexing. The last few minutes were for the candidate's own questions.

History (before Nov 2023)

Ten Product Intern and SheCodes reports, newest first by the date shown.

PI H01: a geometric-series warm-up

Report date: Sep 2023 · Role: Product Intern, SheCodes · Result: Selected

  1. Online test: multiple-choice sections and one easy or medium coding problem.
  2. One hour: a complexity warm-up that needed a geometric series, a recursion question and its cost, then one main problem to design, code and analyse (not disclosed).

PI H02: two linked-list problems

Report date: Aug 2023 · Role: Product Intern, SheCodes (on campus) · Result: Not selected

  1. Online test: aptitude and logic questions and one easy coding problem (the fewest swaps to sort an array, done with selection sort).
  2. Online interview: a favourite subject, then TCP versus UDP and a real use of UDP, what makes HTTPS secure, threads, CPU pipeline stages, multiprogramming and thrashing.
  3. Sort a linked list, brute force then better (Sort a Linked List), and Reverse a Singly Linked List.

PI H03: a spiral, a line sweep and an ID registry

Interview date: Aug 2023 · Role: Product Intern (on campus) · Result: Selected

  1. Online test (90 minutes): aptitude, CS multiple-choice questions and two medium coding problems, one of which the candidate matched to a minimum sum of absolute differences.
  2. Read a Matrix in Spiral Order, moving from nested loops to four boundary pointers when asked to optimise.
  3. A problem the candidate matched to a known practice question, rated hard there: the fewest days until some point holds k virus variants. A line sweep impressed the interviewer (Fewest Days Until a Point Holds k Variants).
  4. Normal forms, virtualization and virtual memory, and tables for a national ID system with a fast lookup for one person among a million rows (Design Tables for a National ID Registry).

PI H04: no DSA at all

Report date: Nov 2022 · Role: Product Intern (on campus) · Result: Selected (2 of 12)

  1. Online test (one hour): five probability and counting questions, and two coding problems: LeetCode 1579 (remove the most edges while the graph stays fully traversable) and the cheapest string over four letters with no two equal neighbours, from an n x 4 cost table.
  2. A 45 to 50 minute call with no DSA: why the project was built the way it was and what another design would break (practice); the candidate's languages and subjects studied; the diamond problem, runtime polymorphism, smart pointers and vtables; the critical-section problem in pseudocode; and a puzzle on the fewest bridges linking cities on two river banks.

PI H05: a random-pointer list copy

Interview date: Nov 2022 · Role: Product Intern (on campus) · Result: Selected

  1. Round 1 (online, 90 minutes): the 25-horses puzzle and LeetCode 3 with a sliding window (closest practice: First and Last Longest Repeat-Free Substrings).
  2. Round 2 (60 minutes, face to face): LeetCode 138, copy a list with random pointers, by weaving copies in, setting the random links and splitting; the four OOP principles and what a "singular" class is (probably a singleton).

PI H06: a dice calendar puzzle

Report date: Oct 2022 (offer Aug 2022) · Role: Product Intern (on campus) · Location: Noida or Bengaluru · Result: Offer

  1. A two-hour online test: three easy-to-medium coding problems and 16 probability, statistics and linear algebra questions.
  2. A 40-minute call: projects; the puzzle of showing every day of a month with two dice; then an array question (prompt not given), naive to optimal, coded with comments and dry-run.

PI H07: infix to postfix

Report date: Feb 2022 · Role: Product Intern · Result: Offer the next day

  1. After an online test and a resume review, a video interview with screen sharing: tell me about yourself; compile-time versus run-time polymorphism; paging and scheduling; Convert Infix to Postfix; Reverse a Singly Linked List; arrays versus linked lists and a data structure for undo and redo; a BST's worst case and how to fix it.

PI H08: a rotated array's ends

Interview date: 2021 (report date Jan 2022) · Role: SheCodes intern · Location: India · Result: Not disclosed

  1. Online test: multiple-choice sections, two coding problems on trees and arrays, and short games; then a CV shortlist.
  2. A live-editor interview: Middle Node of a Linked List, reading matrix cells, and Smallest and Largest in a Rotated Sorted Array. The candidate solved all three but not in the most efficient way.

PI H09: puzzles and an iterative inorder walk

Interview date: Dec 2021 · Role: Product Intern, SheCodes (on campus) · Result: Not disclosed

  1. Online tests in Oct 2021, the second with two medium-to-hard problems: a string's rank in dictionary order, and an array question.
  2. About an hour: tell me about yourself; a geometry puzzle (dropped) and a finger-counting puzzle (the candidate needed the answer explained); inorder traversal, then without recursion, which ran long (Inorder Traversal Without Recursion); Reverse a Singly Linked List; bit swapping; projects.

PI H10: Two Sum and a zigzag

Interview date: Mar 2021 · Role: SheCodes intern · Result: Not selected (places filled)

  1. A 70 to 80 minute interview: Find the Pair With a Target Sum, where edge cases surfaced only in a dry run; Zigzag Level Order of a Binary Tree after a hint; how vectors, heaps and stacks work inside; a puzzle and OS questions.

Keep practicing

In this series

Sources: Anywhere useful interview info can be found.

Next in this seriesAdobe ML/Research Intern Interviews: 12 Experiences (Part 4 of 4)
0 total reactions. Your reactions: none.

Comments

0

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