Apple Software Engineer Onsite Coding Questions

Given an integer array nums and an integer k, find all continuous subarrays whose sum is exactly equal to k.Solution ApproachUse prefix sum + hash map. Maintain the current prefix sum sum. If sum - k

Hey guys, I have received positive feedback from recruiters after panel interview with Apple three weeks ago and we discussed salary expectations. I was told that the verbal offer will come in a week

hi everyone, i have my final virtual onsite for Apple\'s Siri Rotational Program. i have been told the focus of each interview in the onsite. there are 5 total, but...

Apple onsite interview question. Design a class which implements following functions: func insertOrReplace(_ item: Int, at index: Int) func getMinIndex(of element: Int) -> Int

LeetCode #146: LRU Cache. Difficulty: Medium. Topics: Hash Table, Linked List, Design, Doubly-Linked List. Asked at Apple in the last 6 months.

LeetCode #362: Design Hit Counter. Difficulty: Medium. Topics: Array, Binary Search, Design, Queue, Data Stream. Asked at Apple in the last 6 months.

LeetCode #1: Two Sum. Difficulty: Easy. Topics: Array, Hash Table. Asked at Apple in the last 6 months.

LeetCode #200: Number of Islands. Difficulty: Medium. Topics: Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix. Asked at Apple in the last 6 months.

LeetCode #206: Reverse Linked List. Difficulty: Easy. Topics: Linked List, Recursion. Asked at Apple in the last 6 months.

LeetCode #210: Course Schedule II. Difficulty: Medium. Topics: Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort. Asked at Apple in the last 6 months.

LeetCode #53: Maximum Subarray. Difficulty: Medium. Topics: Array, Divide and Conquer, Dynamic Programming. Asked at Apple in the last 6 months.

LeetCode #56: Merge Intervals. Difficulty: Medium. Topics: Array, Sorting. Asked at Apple in the last 6 months.

LeetCode #253: Meeting Rooms II. Difficulty: Medium. Topics: Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum. Asked at Apple in the last 6 months.

LeetCode #713: Subarray Product Less Than K. Difficulty: Medium. Topics: Array, Binary Search, Sliding Window, Prefix Sum. Asked at Apple in the last 6 months.

LeetCode #981: Time Based Key-Value Store. Difficulty: Medium. Topics: Hash Table, String, Binary Search, Design. Asked at Apple in the last 6 months.

LeetCode #1146: Snapshot Array. Difficulty: Medium. Topics: Array, Hash Table, Binary Search, Design. Asked at Apple in the last 6 months.

LeetCode #23: Merge k Sorted Lists. Difficulty: Hard. Topics: Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort. Asked at Apple in the last 6 months.

LeetCode #49: Group Anagrams. Difficulty: Medium. Topics: Array, Hash Table, String, Sorting. Asked at Apple in the last 6 months.

LeetCode #238: Product of Array Except Self. Difficulty: Medium. Topics: Array, Prefix Sum. Asked at Apple in the last 6 months.

LeetCode #347: Top K Frequent Elements. Difficulty: Medium. Topics: Array, Hash Table, Divide and Conquer, Sorting, Heap (Priority Queue), Bucket Sort, Counting, Quickselect. Asked at Apple in the last 6 months.