class GfG {
ArrayList find3Numbers(ArrayList arr, int n) {
ArrayList a= new ArrayList<>();
int max=n-1;
int min=0;
int smaller[]=new int[n];
int greater[]=new int[n];
smaller[0]=-1;
//search smallest elements from left
System.out.println(“min”);
for(int i=0;i<n;i++)
{
if(arr.get(min)>=arr.get(i))
{
min = i;
smaller[i]=-1;
}
else{
smaller[i]=min;
System.out.println(min +" “+i);}
}
greater[n-1]=-1;
//search greatest from right
System.out.println(“max”);
for(int i=n-2;i>=0;i–)
{
if(arr.get(max)<arr.get(i))
{
max=i;
greater[i]=-1;
}
else{
greater[i]=max;
System.out.println(max+” “+i);}
}
System.out.println(”************");
for(int i=0;i<n;i++)
{
if(smaller[i]!=-1 && greater[i]!=-1)
{
System.out.println(i);
a.add(smaller[i]);
a.add(arr.get(i));
a.add(greater[i]);
break;
}
}
return a;
}
}