The video interview on Zoom lasted sixty minutes.

The interviewer, a senior manager, spoke with me for about five minutes before asking a non-LeetCode dynamic programming question. I did not finish the problem within the allotted time.

Let's say we have apps that can be installed on a system. Each app requires 'd' bytes of space while downloading and takes up 's' bytes of space after the download is complete. Notice that, to install an app, we need at least max(d, s) bytes of space available. All three cases are possible: d < s, d = s, and d > s.

Example: App 1: (d1, s1) = (3, 4) App 2: (d2, s2) = (5, 7)

Assuming the system can handle the storage space of both apps, we should try to minimize the temporary space needed while the second app is downloading. If app 'i' is installed first, how much space is needed while app 'j' is downloading? What if app 'j' is installed first?

Memory Graph: 1, 2 -> 3, 4, 9, 11 2, 1 -> 5, 7, 10, 11