Hacker Rank - Disk Space Analysis
C# solution for HackerRank's Disk space analysis challenge.
Example
For following array [2, 5, 4, 6, 8] with x = 3, the answer is 4 see below
The chunks would be:
[2, 5, 4] -> min: 2
[5, 4, 6] -> min: 4
[4, 6, 8] -> min: 4