Apple interview questions

Last Stone Weight

Given an array of stone weights, repeatedly take the two heaviest stones, remove them, and if their weights differ push back the difference; return the…

Companies: Apple, Salesforce

Array · Heap (Priority Queue)

Last Stone Weight II

Split the stones into two groups to minimize the absolute difference of their total weights — equivalent to finding the largest subset sum ≤ total_sum/2…

Companies: Apple

0-1 Knapsack · Array · Dynamic Programming · Knapsack Problem

LC Mediums and mentorship based behavioral questions.

Companies: Apple

Leetcode, background, work experience, job related exercises

Companies: Apple

Longest Common Subsequence

Find the length of the longest sequence of characters that appears in both input strings in the same relative order (not necessarily contiguous). This is…

Companies: Apple

Dynamic Programming · Longest Common Subsequence · String

Lowest Common Ancestor of a Binary Tree III

Companies: Apple, Amazon, Meta

Binary Lifting · Binary Tree · Hash Table · Lowest Common Ancestor

Maximum Swap

Given a nonnegative integer, perform at most one swap of two digits to obtain the largest possible number. This is solved greedily by identifying the…

Companies: Apple

Greedy · Math

Meeting Rooms III

Assign each meeting (with unique start times) to the lowest-numbered available room or delay it (keeping its duration and prioritizing earlier original start times) until…

Companies: Apple, Docusign, Google, Meta +2

Array · Hash Table · Heap (Priority Queue) · Simulation

Minimum Cost to Hire K Workers

Choose k workers and pay each proportional to quality while meeting their minimum wages; the group's cost equals (sum of selected qualities) * max(wage[i]/quality[i]) among…

Companies: Apple

Array · Greedy · Heap (Priority Queue) · Sorting

Please explain me this project that you worked in your past X company and also make me understand the whole system design flow and how you navigated from the front end to back end and also explain the thought process for the cloud architecture used and why a SQL v. NoSQL was used.

Please explain me this project that you worked in your past X company and also make me understand the whole system design flow and how…

Companies: Apple

Random Pick with Weight

Given an array of positive weights, implement pickIndex() to return index i with probability w[i]/sum(w); the typical approach preprocessing prefix sums and using a random…

Companies: Apple, Amazon, Goldman Sachs, Meta +4

Array · Binary Search · Math · Prefix Sum

Reverse Linked List

Companies: Apple, TikTok

Linked List · Recursion

Rotate Array

Rotate an integer array to the right by k steps (k may exceed the array length), effectively moving each element to index (i+k) mod n…

Companies: Apple, Microsoft, Nutanix, TikTok

Array · Math · Two Pointers

Snapshot Array

Design a versioned array that supports point updates, taking snapshots (returning increasing snap_ids), and querying the value at an index for a given snap_id. The…

Companies: Apple, Amazon, Anduril, MongoDB

Array · Binary Search · Design · Hash Table

String Compression

Compress an array of characters in-place by replacing each run of consecutive identical characters with the character followed by its run length (omit the length…

Companies: Apple, Goldman Sachs, Morgan Stanley, Pinterest +1

String · Two Pointers

Subarray Sum Equals K

Count the number of contiguous, non-empty subarrays whose elements sum to k. Because nums can include negatives (so two-pointer sliding window doesn't work), use cumulative…

Companies: Apple, Amazon, Bloomberg, Google +3

Array · Hash Table · Prefix Sum

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand (e.g., [4,5,6,7,0,1,2]). Search for a target value and return its index, or -1 if not found. Required time complexity: O(log n).

Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand (e.g., [4,5,6,7,0,1,2]). Search for a target value and return…

Companies: Apple

Task Scheduler

Given tasks labeled A–Z and a cooldown n, compute the minimum number of CPU intervals (including idles) to finish all tasks so that identical tasks…

Companies: Apple, Amazon, Databricks, Docker +3

Array · Counting · Greedy · Hash Table

Tell me about yourself

Question: Tell me about yourself

Companies: Apple, Adyen, Amazon, Anthropic +13

Tell me about yourself. How would you design xyz. How often would you run these test cases.

Companies: Apple

tell me diff bet class component and function component

Companies: Apple