Refreshed monthly, last refreshed on June 13, 2026
| Problem | Patterns | Difficulty | |
|---|---|---|---|
| 402. Remove K Digits | Medium | ||
| 3647. Maximum Weight in Two Bags | Medium | ||
| 1437. Check If All 1's Are at Least Length K Places Away | Easy | ||
| 2021. Brightest Position on Street | Medium | ||
| 85. Maximal Rectangle | Hard | ||
| 361. Bomb Enemy | Medium | ||
| 205. Isomorphic Strings | Easy | ||
| 351. Android Unlock Patterns | Medium | ||
| 653. Two Sum IV - Input is a BST | Easy | ||
| 198. House Robber | Medium | ||
| π | 9. Palindrome Number | Basic DSA | Easy |
| π | 133. Clone Graph | Depth-First SearchBreadth-First SearchGraph | Medium |
| π | 286. Walls and Gates | Breadth-First Search | Medium |
| π | 295. Find Median from Data Stream | Two PointersBasic DSA | Hard |
| π | 109. Convert Sorted List to Binary Search Tree | Basic DSAMisc. | Medium |
| π | 1642. Furthest Building You Can Reach | Misc. | Medium |
| π | 273. Integer to English Words | Backtracking | Hard |
| π | 948. Bag of Tokens | Misc.Two PointersBasic DSA | Medium |
| π | 1675. Minimize Deviation in Array | Misc.Adv. Data Structure | Hard |
| π | 146. LRU Cache | Basic DSA | Medium |
| π | 2407. Longest Increasing Subsequence II | Adv. Data StructureMisc.Dynamic Programming | Hard |
| π | 2161. Partition Array According to Given Pivot | Two PointersSimulation | Medium |
| π | 422. Valid Word Square | Basic DSA | Easy |
| π | 2667. Create Hello World Function | Basic DSA | Easy |
| π | 1291. Sequential Digits | Basic DSA | Medium |
| π | 768. Max Chunks To Make Sorted II | Misc.Basic DSA | Hard |
| π | 3040. Maximum Number of Operations With the Same Score II | BacktrackingDynamic Programming | Medium |
| π | 2444. Count Subarrays With Fixed Bounds | Two PointersMisc. | Hard |
| π | 388. Longest Absolute File Path | Depth-First Search | Medium |
| π | 446. Arithmetic Slices II - Subsequence | Dynamic Programming | Hard |
| π | 1171. Remove Zero Sum Consecutive Nodes from Linked List | Basic DSA | Medium |
| π | 279. Perfect Squares | Breadth-First SearchDynamic Programming | Medium |
| π | 1. Two Sum | Basic DSA | Easy |
| π | 1913. Maximum Product Difference Between Two Pairs | Basic DSA | Easy |
| π | 3. Longest Substring Without Repeating Characters | Two Pointers | Medium |
| π | 1481. Least Number of Unique Integers after K Removals | Misc.Basic DSA | Medium |
| π | 341. Flatten Nested List Iterator | Depth-First Search | Medium |
| π | 455. Assign Cookies | Misc.Two PointersBasic DSA | Easy |
| π | 443. String Compression | Two Pointers | Medium |
| π | 56. Merge Intervals | Basic DSA | Medium |
| π | 1347. Minimum Number of Steps to Make Two Strings Anagram | Basic DSA | Medium |
| π | 2385. Amount of Time for Binary Tree to Be Infected | Depth-First SearchBreadth-First Search | Medium |
| π | 907. Sum of Subarray Minimums | Dynamic ProgrammingMisc. | Medium |
| π | 646. Maximum Length of Pair Chain | Misc.Dynamic ProgrammingBasic DSA | Medium |
| π | 14. Longest Common Prefix | Adv. Data Structure | Easy |
| π | 36. Valid Sudoku | Basic DSA | Medium |
| π | 1352. Product of the Last K Numbers | Two Pointers | Medium |
| π | 242. Valid Anagram | Basic DSA | Easy |
| π | 362. Design Hit Counter | Binary Search | Medium |
| π | 3019. Number of Changing Keys | Basic DSA | Easy |
| π | 2962. Count Subarrays Where Max Element Appears at Least K Times | Two Pointers | Medium |
| π | 263. Ugly Number | Basic DSA | Easy |
| π | 49. Group Anagrams | Basic DSA | Medium |
| π | 740. Delete and Earn | Dynamic Programming | Medium |
| π | 2. Add Two Numbers | BacktrackingBasic DSA | Medium |
| π | 713. Subarray Product Less Than K | Two Pointers | Medium |
| π | 1287. Element Appearing More Than 25% In Sorted Array | Basic DSA | Easy |
| π | 2870. Minimum Number of Operations to Make Array Empty | Misc.Basic DSA | Medium |
| π | 380. Insert Delete GetRandom O(1) | Basic DSA | Medium |
| π | 496. Next Greater Element I | Misc. | Easy |
| π | 1436. Destination City | Basic DSA | Easy |
| π | 2621. Sleep | Basic DSA | Easy |
| π | 207. Course Schedule | Depth-First SearchBreadth-First SearchGraph | Medium |
| π | 767. Reorganize String | Misc.Basic DSA | Medium |
| π | 771. Jewels and Stones | Basic DSA | Easy |
| π | 430. Flatten a Multilevel Doubly Linked List | Depth-First SearchBasic DSA | Medium |
Sign up for free to track your progress, then upgrade to Pro for all 66 questions with detailed solutions.
Sign Up FreeThe interview process at Apple for software engineering roles begins with a thorough resume screening, aimed at identifying candidates who not only possess the technical expertise but also align with Apple's innovative culture. The initial phase often includes Online Assessments (OAs) focusing on coding and problem-solving skills which are crucial for the subsequent steps.
Following the OA, candidates typically undergo one or two phone screens, which involve both technical questions and discussions about past projects or experiences. Those who excel in these rounds are invited to the onsite interviews, which can include multiple rounds with different team members and are known for their difficulty. This stage assesses both technical acumen and cultural fit, with problems often relating to real-world scenarios Apple engineers face.
At Apple, the resume screening process is keenly focused on past project relevance and technical skill sets. Aim to align your resume closely with the job description to which you're applying.
For software engineering roles, Apple might send out Online Assessments (OAs) to gauge coding proficiency and problem-solving skills. Typically, this is followed by a preliminary screening call if your assessment scores meet their criteria.
At Apple, the interview process typically includes one or two phone screens. These initial calls focus on assessing the candidate's technical skills and problem-solving abilities through coding exercises and detailed discussions on previous projects.
The phone screens also give candidates a chance to demonstrate their communication abilities, which are crucial for collaboration within Apple's team-oriented culture. Expect questions that probe into your understanding of algorithms, data structures, and system design.
During the onsite rounds at Apple, candidates typically face three to six interviews. These are a mix of coding tests, system design challenges, and behavioral discussions to assess cultural fit and teamwork abilities.
Interview formats might vary but generally include one-on-one sessions with both peers and senior team members. Expect to engage in hands-on problem-solving as well as discussions that can showcase your thought process and collaboration skills.
After completing the interview rounds at Apple, candidates may undergo team matching to ensure a good fit. Following this, there can be meetings with executives, and then offer negotiation begins.
Can you describe a project where you had to use both innovation and standard methodologies to solve software engineering problems?
Tell me about a time when your team faced a significant challenge. How did you contribute to resolving the issue?
Describe a situation where you had to learn a new technology or framework to complete a project. How did you approach the learning curve?
Describe a time when you had to collaborate closely with a team to solve a challenging technical problem.
Can you talk about a project where you had to integrate feedback from multiple teams, possibly including some feedback that contradicted your own views?
Apple prides itself on innovation. Provide an example of a time when you contributed an innovative solution during a team project.
Describe a project where you had to implement a software solution that required deep understanding of user privacy concerns.
Tell me about a time when you disagreed with a team member on a project. How did you handle the situation?
Apple prides itself on innovation. Can you discuss an innovative solution you developed or contributed to in your past experience?