RepostedApple logo

Apple · OA → Phone screen → Onsite

In process

Apple New Grad SWE Phone Screens: 12 Experiences (Part 3 of 3)

Software engineer · New GradMar 2021
Shared byJaneBeingJane

Apple new grad SWE reports from 2015 to 2022: 45-minute phone screens with classic LeetCode problems, C tasks for systems teams and onsites of five rounds.

At a glance

All twelve reports here are from 2015 to 2022, more than three years old, so the whole part sits under History. For current reports, see Parts 1 and 2.

  • Process: recruiter or conference contact, then one to three phone interviews of 45 to 60 minutes (H28, H33, H35, H36), then an onsite of about five interviews (H28, H29). Two reports had an online assessment first: a 90-minute HackerRank (H30) and a 53-minute AMCAT (H34).
  • Asked in this period: coding in 10 of 12 reports, often classic LeetCode problems: Merge Intervals, Coin Change II, Lowest Common Ancestor and atoi in C. OS and concurrency came up in 2 (H32, H37).
  • Difficulty: phone screens were easy in H28, but a 2021 onsite had DFS and DP Hards (H29) and a 2018 screen had a string Hard (H35).
  • Practise first: Reverse a Linked List, Subarray Sum Equals K and Producer-Consumer Queue.

Coverage: Apple new grad software roles from September 2015 to October 2022: SWE new grad, Evolve, AMP, Platform Architecture, AI/ML and ML infrastructure teams, a 12-month graduate placement and one campus SDE1 report. Boston, Cupertino and other US locations where stated.

In this series

  • Part 1: entries 01–09, the 2026 reports: C screens, BigDecimal questions and five-interview panels.
  • Part 2: entries 10–25, 2023–2025: Taipei, Cork, Austin, New York and US teams, plus two older reports.
  • Part 3 (current): entries 26–37, 2015–2022: Evolve, a graduate placement OA, phone screens and C tasks.

What came up

Before 2023, Apple's new grad screens were mostly classic coding problems, with C and OS questions for systems teams. Counts cover the 12 reports in this part.

Topic Reports Last seen
Coding and data structures 10 of 12 Apr 2022 (report date)
Resume, behavioral or manager talk 5 of 12 Oct 2022
Arrays, subarrays and DP 3 of 12 Sep 2021
Trees 2 of 12 Sep 2021
C programming 2 of 12 Dec 2019 (report date)
OS and concurrency 2 of 12 Dec 2019 (report date)
Online assessment 2 of 12 Feb 2021 (report date)
System design 1 of 12 Sep 2021

A candidate can appear in more than one row.

Questions we found

Algorithms / Data Structures, 2020–2022

Question Reports Last seen
Reverse a linked list 1 Jan 2022 (report date)
Lowest common ancestor 1 Sep 2021
Subarray Sum Equals K 1 Sep 2021
Largest later value minus an earlier value 1 Feb 2021 (report date)
Longest strictly increasing subsequence 1 Feb 2021 (report date)

Algorithms / Data Structures, 2015–2019

Question Reports Last seen
Implement a queue in C 1 Dec 2019 (report date)
First and last position of a target in a sorted array 1 2019
Return every element after a target 1 May 2019
Merge Intervals 1 Apr 2019
Shortest subarray with sum at least K 1 Apr 2019
Count pairs whose sum is a multiple of K 1 Apr 2019
Coin combinations with coins 3, 5 and 10 1 Apr 2019
Nearest different palindrome 1 Apr 2019
Find the next leaf in a tree 1 May 2018
Implement atoi in C 1 Oct 2015

System Design

Question Reports Last seen
Design an ML platform 1 Sep 2021
Design a database schema 1 Sep 2021

OS and language concepts

Question Reports Last seen
How do condition variables, a mutex and a semaphore fit a queue? 1 Dec 2019 (report date)
Threads versus processes, deadlocks, hash map complexity 1 Sep 2015

History (before November 2023): 12 detailed candidate timelines

H26: Evolve: two conversations, then a panel invite

Interview period: October 2022 · Role: Evolve, spring 2023 graduate cohort · Result: Invited to panel

  1. A 30-minute call with the hiring team, then a 45-minute behavioral interview with a senior engineer or manager, with high-level resume talk.
  2. A panel invite followed. No coding question was shared.

H27: Two US interviews with no LeetCode-style question

Report date: April 20, 2022 · Role: New Grad Software Engineer · Location: US

  1. First conversation: a senior engineer introduced the organization and answered questions.
  2. Technical lead: a coding task specific to the role, plus domain questions. The candidate said there was no standard LeetCode question and no behavioral question. The task's domain was not shared.

H28: Three phone interviews before a six-hour onsite

Report date: January 18, 2022 · Role: SWE new grad

  1. About three 45-minute calls with easy questions, including reversing a list and a palindrome task (what it returned was not said), plus detailed resume questions.
  2. They moved forward with one team to an onsite planned for about six hours: 45-minute interviews with 15 to 30-minute breaks.

H29: One graduate, three Apple teams

Interview period: July–October 2021 · Role: Graduate SWE search after an Apple internship · Graduation: December 2021

The internship did not convert because of headcount, so they applied to several teams inside Apple.

AMP Commerce

  1. Phone interview, September 7: lowest common ancestor. Second phone interview, September 14: an unnamed Trie Hard.
  2. Virtual onsite, September 24, five conversations: database schema design; Subarray Sum Equals K; an unnamed DFS Hard; an unnamed DP Hard; and a hiring manager and behavioral talk.
  3. They were told they had passed, then that there was no headcount.

AI/ML Rotation

  1. An information call July 27, then a phone interview August 17 with an unnamed stack Medium. Rejected.

ML Infrastructure

  1. Phone interview September 14 with two unnamed easy questions.
  2. Onsite September 28: two Python coding interviews with easy tasks, ML platform system design, and three behavioral and hiring-manager talks, one with an unnamed brain teaser. Rejected.

H30: A 12-month graduate placement OA

Report date: February 1, 2021 · Role: Graduate software engineering placement (12 months, Shazam team)

  1. Seven days to start a 90-minute HackerRank, with 19 languages to choose from.
  2. Largest later value minus an earlier value, returning -1 when no positive difference exists. For [3,6,10,1,4,6,5] the answer was 7. They recalled a minimum input length of one.
  3. Length of the longest strictly increasing subsequence: [1,1,3,2,6,4,1,7] gives 4 (for example [1,3,6,7]); a fully descending array gives 1.
  4. This was a fixed-term placement, not a standard permanent new grad role.

H31: A graph problem in a first virtual onsite

Interview date: October 2020 · Role: New grad SWE, master's graduate with no work experience · Result: Rejected

  1. The first virtual onsite interview was one graph problem using backtracking or DFS that they had not seen before.
  2. They wrote and ran a solution, and were rejected three days later. The exact task was not shared.

H32: Platform Architecture: a conference question, then a C queue

Interview period: 2019 (report December 10, 2019) · Role: SWE new grad · Team: Platform Architecture

  1. Conference chat at Grace Hopper: about 15 minutes of OS questions, then find the first and last positions of a target in a sorted array.
  2. Phone interview: implement a queue in C and handle special cases. Follow-ups: how condition variables, a mutex and a semaphore relate to it, then OS, computer architecture and compilers. Capacity, number of producers and blocking behavior were not given.

H33: AMP: return every element after the target

Interview date: May 2019 (post dated May 26; the body says May 30) · Role: New Grad Software Engineer, AMP · Location: Cupertino

  1. One-hour CoderPad phone interview: given a list of objects and a target from it, return every element after the target. For [1,2,3,4] and 2, return [3,4]; the last element returns an empty list; a null target is an error.
  2. Follow-ups on efficiency and complexity. Another phone interview and an onsite were planned.

H34: An AMCAT OA, then subarrays, pairs, coins and palindromes

Interview period: March–April 2019 · Role: SDE1, campus (the post's level label says Experienced)

  1. AMCAT OA, about 53 minutes: nine multiple-choice questions and two Medium coding questions, one of them Merge Intervals.
  2. Technical, 60 minutes: the shortest contiguous subarray with sum at least K, or -1; and count index pairs whose sum is a multiple of K, where equal values at different positions count as different pairs.
  3. Technical and behavioral, 60 minutes: count the ways to make an amount with unlimited coins of 3, 5 and 10, order not mattering; and find the nearest different palindrome, taking the smaller on a tie (121 maps to 111).

H35: Cupertino: two phone interviews and a next-leaf question

Interview date: May 2018 · Role: SWE new grad · Location: Cupertino

  1. First phone interview, 45 minutes: 15 to 20 minutes of introductions and resume, then an unnamed string LeetCode Hard.
  2. Second phone interview, 45 minutes: given a leaf in a tree, find the next leaf. The tree interface and traversal order were not fully recalled.

H36: Boston: implement atoi in C

Interview date: October 2015 · Role: SWE new grad · Location: Boston

  1. A 45-minute phone interview set up by a recruiter. The first 15 minutes were resume and projects.
  2. The task: implement atoi in C. The candidate mostly used Java and Swift and had not prepared C. Whitespace, invalid-character and overflow rules were not recalled.

H37: A campus chat on CS and Java

Interview date: September 2015 · Role: SWE new grad, campus recruiting

  1. A 30-minute technical discussion with no coding.
  2. Threads versus processes, deadlocks, hash maps and their complexity, basic algorithms, and differences between Java classes and implementations. No specific class names were given.

Patterns across the reports

  1. 45-minute phone screens. Phone interviews were 45 minutes in H28, H35 and H36, and one hour on CoderPad in H33.
  2. C for systems teams. A C queue with synchronization follow-ups (H32) and atoi in C (H36).
  3. Onsites of about five interviews. Five conversations in the AMP Commerce onsite (H29); H28's planned onsite ran about six hours.

Common questions

What did Apple ask new grads in older phone screens?

Classic problems: reversing a list (H28), lowest common ancestor (H29), elements after a target (H33), the next leaf in a tree (H35) and atoi in C (H36).

How long was the Apple new grad onsite?

About six hours of 45-minute interviews in H28's plan; five conversations in H29's AMP Commerce onsite.

Did Apple give new grads an online assessment?

Two reports had one: a 90-minute HackerRank for a graduate placement (H30) and a 53-minute AMCAT for a campus SDE1 role (H34). The others went straight to interviews.

Keep practicing

In this series

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.