Second largest element

#include <iostream>
#include <vector>
#include <climits> // For INT_MIN

using namespace std;

int getSecondLargest(vector<int> &arr) {
    int n = arr.size();

    if (n < 2) {
        return -1; // Return -1 if there are fewer than two elements
    }

    int largest = INT_MIN, secondLargest = INT_MIN;

    for (int i = 0; i < n; i++) {
        if (arr[i] > largest) {
            secondLargest = largest;
            largest = arr[i];
        } else if (arr[i] < largest && arr[i] > secondLargest) {
            secondLargest = arr[i];
        }
    }

    return (secondLargest == INT_MIN) ? -1 : secondLargest; // Return -1 if no second largest found
}

int main() {
    int N;
    cin >> N;
    vector<int> A(N);

    for (int i = 0; i < N; i++) {
        cin >> A[i];
    }

    int result = getSecondLargest(A);
    if (result != -1) {
        cout << "Second largest element: " << result << endl;
    } else {
        cout << "No second largest element found" << endl;
    }

    return 0;
}
// it clearly tackle out ith all the edge cases