local min

 public static int solution(int[] A)
        {
            var maxDepth = int.MaxValue;
            var counter = 0;
            for (int i = 1; i < A.Length - 1; i++)
            {
                var current = A[i];
                var previous = A[i - 1];
                var next = A[i + 1];

                if (previous > current && current <= next)
                {
                    if (current < maxDepth)
                    {
                        maxDepth = current;
                    }
                }

            }

            return maxDepth;

        }