using System;

using System.Collections.Generic;

using System.Linq;

​

public class Program

{

    //Given an array, find the nearest smaller element G[i] for every element A[i] in the array such that the element has an index smaller than i.

    //Elements for which no smaller element exist, consider next smaller element as -1.

    //for example for 2 6 4 7 9 4 3 4

    //you should output -1 2 2 4 7 2 2 3

    public static void Main()

    {

        var n = new[] { 2, 6, 4, 7, 9, 4, 3, 4 };

        Console.WriteLine(Enumerable.SequenceEqual(FindNearesSmallest(n), new[] {-1, 2, 2, 4, 7, 2, 2, 3}));

        IEnumerable<int> FindNearesSmallest(int[] input)

        {

            for(int i=0;i<input.Length-1;i++){

                if(i!=0)

                {

                    if(n[i]<n[i-1]){

                        n[i]=-1;

                    }

                    else{

                        n[i]=n[i-1];

                    }

                }

            }

            return input;

        }

    }

}