Apple
Deeply team-specific loops with no standard script — the screen is half résumé interrogation, and the coding half favours “implement this class, then extend it” over puzzles, with a requirement added the moment the first version works. Optimal on the first pass, narration throughout, and the memory bound volunteered on anything involving “millions”.
Typical loop
- 1Recruiter screen — ask which shape the technical screen takes: algorithmic, practical/domain, or design
- 2Hiring-manager call: résumé deep-dive (baseline, instrument, confounder for every number), often with a coding question of its own
- 3Technical phone screen: 45–60 min on CoderPad over WebEx, roughly half résumé and half one problem; some are voice-only design
- 4A second technical screen is normal
- 5Onsite: four to six team-specific rounds — coding, design/OOD, résumé deep-dive, behavioural
- 6Cross-functional round with a partner team
Questions
Callback's practice questions and the LeetCode questions Apple has been asking, filtered together.
Asked on LeetCode
298 questions · all time
- Maximum Sum Circular SubarraymediumArrayDivide and ConquerDynamic ProgrammingQueue+1frequency 22.0
- Meeting SchedulermediumArrayTwo PointersSortingfrequency 22.0
- Minimize Maximum Component CostmediumBinary SearchUnion-FindGraph TheorySortingfrequency 22.0
- Minimum Falling Path SummediumArrayDynamic ProgrammingMatrixfrequency 22.0
- Minimum Remove to Make Valid ParenthesesmediumStringStackfrequency 22.0
- Minimum Size Subarray SummediumArrayBinary SearchSliding WindowPrefix Sumfrequency 22.0
- Minimum Speed to Arrive on TimemediumArrayBinary Searchfrequency 22.0
- Minimum Window SubstringhardHash TableStringSliding Windowfrequency 22.0
- Moving Average from Data StreameasyArrayDesignQueueData Streamfrequency 22.0
- My Calendar ImediumArrayBinary SearchDesignSegment Tree+1frequency 22.0
- Next Greater Element IeasyArrayHash TableStackMonotonic Stackfrequency 22.0
- Non-overlapping IntervalsmediumArrayDynamic ProgrammingGreedySortingfrequency 22.0
- Number of Recent CallseasyDesignQueueData Streamfrequency 22.0
- One Edit DistancemediumTwo PointersStringfrequency 22.0
- Optimize Water Distribution in a VillagehardUnion-FindGraph TheoryHeap (Priority Queue)Minimum Spanning Tree+3frequency 22.0
- Pacific Atlantic Water FlowmediumArrayDepth-First SearchBreadth-First SearchMatrixfrequency 22.0
- Partition Equal Subset SummediumArrayDynamic ProgrammingKnapsack Problem0-1 Knapsackfrequency 22.0
- Permutation in StringmediumHash TableTwo PointersStringSliding Windowfrequency 22.0
- Product of the Last K NumbersmediumArrayMathDesignData Stream+1frequency 22.0
- Read N Characters Given Read4easyArraySimulationInteractivefrequency 22.0
- Redundant ConnectionmediumDepth-First SearchBreadth-First SearchUnion-FindGraph Theoryfrequency 22.0
- Remove Duplicates from Sorted List IImediumLinked ListTwo Pointersfrequency 22.0
- Remove Linked List ElementseasyLinked ListRecursionfrequency 22.0
- Reverse Linked List IImediumLinked Listfrequency 22.0
- Reverse Nodes in k-GrouphardLinked ListRecursionfrequency 22.0
- Reverse PairshardArrayBinary SearchDivide and ConquerBinary Indexed Tree+4frequency 22.0
- Reverse Vowels of a StringeasyTwo PointersStringfrequency 22.0
- Second Highest SalarymediumDatabasefrequency 22.0
- Sentence Similarity IImediumArrayHash TableStringDepth-First Search+2frequency 22.0
- Shortest Distance from All BuildingshardArrayBreadth-First SearchMatrixfrequency 22.0
- Similar String GroupshardArrayHash TableStringDepth-First Search+2frequency 22.0
- Simplify PathmediumStringStackfrequency 22.0
- Sliding Window MedianhardArrayHash TableSliding WindowHeap (Priority Queue)+1frequency 22.0
- Snakes and LaddersmediumArrayBreadth-First SearchMatrixfrequency 22.0
- Spiral Matrix IImediumArrayMatrixSimulationfrequency 22.0
- Split Strings by SeparatoreasyArrayStringfrequency 22.0
- String Compression IIImediumStringfrequency 22.0
- Substring with Concatenation of All WordshardHash TableStringSliding Windowfrequency 22.0
- Sum of Subarray RangesmediumArrayStackMonotonic Stackfrequency 22.0
- Symmetric TreeeasyTreeDepth-First SearchBreadth-First SearchBinary Treefrequency 22.0
- The MazemediumArrayDepth-First SearchBreadth-First SearchMatrixfrequency 22.0
- The Skyline ProblemhardArrayDivide and ConquerBinary Indexed TreeSegment Tree+4frequency 22.0
- Valid Palindrome IIeasyTwo PointersStringGreedyfrequency 22.0
- Verifying an Alien DictionaryeasyArrayHash TableStringfrequency 22.0
- Walking Robot SimulationmediumArrayHash TableSimulationfrequency 22.0
- Water and Jug ProblemmediumMathDepth-First SearchBreadth-First SearchBézout's Lemma+3frequency 22.0
- Web Crawler MultithreadedmediumDepth-First SearchBreadth-First SearchConcurrencyfrequency 22.0
- Zigzag ConversionmediumStringfrequency 22.0