> For the complete documentation index, see [llms.txt](https://docs-57.gitbook.io/data-structure-and-algorithms/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://docs-57.gitbook.io/data-structure-and-algorithms/problems/graph/widest-path-without-trees.md).

# Widest Path Without Trees

There are `N` trees (numbered from `0` to `N-1`) in a forest. The `K-th` tree is located at coordinates `(X[K], Y[K])`. We want to build the widest possible vertical path, such that there is no tree on it. The path must be built somewhere between a leftmost and a rightmost tree, which means that the width of the path cannot be infinite.

What is the width of the widest possible path that can be built?

Write a function:

```
1def solution(X, Y)
```

that, given two arrays `X` and `Y` consisting of `N` integers each, denoting the positions of trees, returns the widest possible path that can be built.

**Example 1:**

Input: X = `[5,5,5,7,7,7]`, Y = `[3,4,5,1,3,7]`

Output: `2`

public class Solution {

```csharp
public int solution(int[] X, int[] Y)
{
    int maxGap = 0;
    if (X?.Length > 0)
    {
        Array.Sort(X);

        for (int i = 1; i < X.Length; i++)
        {
            maxGap = Math.Max(maxGap, X[i] - X[i - 1]);
        }
    }
    return maxGap;
}
```

}