McDonald's Interview Questions, Process, and Tips

Use merge sort algorithm to sort the array in O(nlogn) time complexity.

• Implement merge sort algorithm which divides the array into two halves, recursively sorts the halves, and then merges the sorted halves.

• Time complexity of merge sort is O(nlogn) where n is the number of elements in the array.

• Example: ['apple', 'banana', 'cherry', 'date'] can be sorted using merge sort in O(nlogn) time complexity.

Use binary search to find element in sorted array efficiently.

• Start with middle element and compare with target

• If target is less, search left half, if greater search right half

• Repeat until element is found or search space is empty