Apple Mobile Engineer Interview Questions

The Apple App Store needs an efficient way to prioritize app downloads based on existing network conditions and app size.
Problem statement: You need to implement a function minDownloadTime(int[][] apps) where each app is characterized by its size and the download speed at which it can be fetched. Your goal is to minimize the total download time by choosing the optimal order to download these apps.Example 1:
Input: apps = [[3, 1], [5, 2], [2, 1]]
Output: 4
Explanation: Downloading the second app takes 3 seconds, then the first app takes 1 second by the time network conditions stabilize, thus minimizing total time.Example 2:
Input: apps = [[2, 2], [1, 1], [3, 1]]
Output: 4
Explanation: All apps can be downloaded in 4 seconds by optimized sequencing. Constraints:
- 1 <= apps.length <= 100
- 1 <= apps[i][0] <= 10^4
- 1 <= apps[i][1] <= 10^3

Apple's Photos app needs to efficiently load images in the view while managing memory constraints on mobile devices.
Problem statement: You are tasked with implementing a function maxVisibleImages(int[] imageSizes, int maxMemory) which returns the maximum number of images that can be loaded at once without exceeding maxMemory given the sizes of each image in the imageSizes array. Implement the function efficiently to handle large input sizes.Example 1:
Input: imageSizes = [100, 200, 300, 400, 500], maxMemory = 600
Output: 3
Explanation: You can load images of size 100, 200, and 300 which sum up to 600.Example 2:
Input: imageSizes = [50, 150, 100, 200], maxMemory = 300
Output: 3
Explanation: You can load images of size 150, 100, and 50 which sum up to 300.Constraints:
- 1 <= imageSizes.length <= 10^5
- 0 <= imageSizes[i] <= 10^3
- 1 <= maxMemory <= 10^6