# Vinay

int large=0; int small=0; int secondLar=0;
// O(n)

// here?
// seeing this?
// you can continue with the implementation, approach was correct
// are you done with the code?


public int secondLarge(a) { 
for(int i=0;i<=a.length;i++){

if(a[i]>=a[i+1])
{

int large=a[i];,

}
else{

small= a[i];

}
if(a[i+2]>=lar)
{
large= a[i];


}
else{

secondLar =a[i+2];
}

}

return secondLar;
}