RepostedApple logo

Apple · Phone screen

In process

Apple SWE Phone Screen: Subarray Products: 1 Experience

Software engineer · Full-timeMaster's degreeReported Nov 18, 2026
Shared byjanebeingjane

A 2026 Apple phone screen on a no-run editor: count subarrays with product below k, then two follow-ups that change the condition and list every subarray.

At a glance

  • Process: one technical phone screen: a self-introduction, then one coding question with two follow-ups (report 01)
  • Asked recently: LeetCode 713, Subarray Product Less Than K, then a product equal to k, then print every qualifying subarray (report 01)
  • Difficulty: the candidate rated it easy; time ran out on the last follow-up
  • Practise first: Subarray Product Less Than K

Coverage: One experienced engineer with a Master's degree, changing jobs, who applied online. The report covers one technical phone screen. It gives October to December 2026 as the interview period and went up on November 18, 2026.

What came up

The screen was written in a shared editor without running the code. The second part changed the condition to a product equal to k, and the third asked for every subarray from the first; for the third, the candidate kept the sliding window in a queue.

Topic Reports Last seen
Coding: subarray product less than k, with two follow-ups 1 of 1 Nov 2026 (report date)

Questions we found

Algorithms / Data Structures

Question Reports Last seen
LeetCode 713, Subarray Product Less Than K; follow-ups: product equal to k, print all subarrays (practice) 1 Nov 2026 (report date)

1 detailed candidate timeline, loops, and screens

01: Experienced SWE, technical phone screen

Interview period: 2026 Q4 · Report date: November 18, 2026 · Role: Software engineer · Degree listed: Master's · Channel: Applied online · Candidate's rating: Positive experience, easy difficulty · Result: Not stated

  1. Introduction. A short self-introduction.
  2. Question. LeetCode 713: count the contiguous subarrays whose product is strictly less than k, written by hand without running it. FastPrep's practice version is Subarray Product Less Than K.
  3. Follow-up 1. How would the solution change if the condition became a product exactly equal to k?
  4. Follow-up 2. Print every subarray from the first question. The candidate kept the current window in a queue and copied it to add each subarray to the result, and was just short of finishing when time ran out.

Result

The report doesn't say how it ended.

Keep practicing

Sources: Anywhere useful interview info can be found.

0 total reactions. Your reactions: none.
0 comments

Comments

0

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