You are given two $0$ indexed integer arrays hens and grains, representing the initial positions of hens and grains along a line.

In each second, any hen can move $1$ unit to the left or $1$ unit to the right, or remain at its current location. When a hen reaches the position of a grain, it eats the grain instantly. All hens can move simultaneously.

Return the minimum time in seconds needed for the hens to eat all the grains.

Constraints:

• $1 \leq$ hens.length, grains.length $\leq 2 \cdot 10^4$

• $0 \leq$ hens[i], grains[j] $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.