Nutanix OA 2026| Distributed Storage Allocation & Virtual Machine Migration

Problem 1 - Distributed Storage Allocation Problem Statement You are given an integer array space, where space[i] represents the available storage on the i-th server block. A client wants to allocate a file across exactly k consecutive server blocks. The capacity of any selected sequence is determined by the minimum available space among those k blocks. Return the maximum possible capacity that can be achieved among all contiguous sequences of length k. Constraints Constraint 1 ≤ space.length ≤ 105 1 ...