# most common apple coding interview questions ## the 15 most asked questions in an apple interview

### Arrays

Determine if the sum of three integers is equal to the given value

#### ​

Problem statement

Given an array of integers and a value, determine if there are any three integers in the array whose sum equals the given value.

Merge overlapping intervals

#### ​

Problem statement

Given a list of intervals, merge all the overlapping intervals to produce a list that has only mutually exclusive intervals.

#### ​

Problem statement

Given the head pointers of two linked lists where each linked list represents an integer number (each node is a digit), add them and return the resulting linked list.

#### ​

Problem statement

Given two sorted linked lists, merge them so that the resulting linked list is also sorted.

### trees

Determine if two binary trees are identical

#### ​

Problem statement

Given the roots of two binary trees, determine if these trees are identical or not. Identical trees have the same layout and data at each node.

Mirror binary tree nodes

#### ​

Problem statement

Given the root node of a binary tree, swap the ‘left’ and ‘right’ children for each node.

### strings

Find all palindrome substrings

#### ​

Problem statement

Given a string find all non-single letter substrings that are palindromes.

Reverse words in a sentence

#### ​

Problem statement

Reverse the order of words in a given sentence (an array of characters).

### dynamic programming

Find the maximum sum of a subarray

#### ​

Problem statement

Given an array of positive numbers and a positive number ‘k’, find the maximum sum of any contiguous subarray of size ‘k’.

### Math and stats

Power of a number

#### ​

Problem statement

Given a double, ‘x’, and an integer, ‘n’, write a function to calculate ‘x’ raised to the power ‘n’.

### backtracking

Find all sum combinations

#### ​

Problem statement

Given a positive integer, target, print all possible combinations of positive integers that sum up to the target number.

### design

Implement a LRU cache

#### ​

Problem statement

Least Recently Used (LRU) is a common caching strategy. It defines the policy to evict elements from the cache to make room for new elements when the cache is full, meaning it discards the least recently used items first.

### sorting and searching

Search in rotated array

#### ​

Problem statement

Search for a given number in a sorted array that has been rotated by some arbitrary number. Return -1 if the number does not exist. Assume that the array does not contain duplicates.

Merge overlapping intervals

#### ​

Problem statement

Given a list of intervals, merge all the overlapping intervals to produce a list that has only mutually exclusive intervals.

*

If you need more prep, check out this comprehensive list of the

have you been asked a question that is not included here in your apple interview?