Algorithm

Initialize two variables leftSum and rightSum to zero.
For every index i, calculate the leftSum up to that index and the rightSum from that index.
At any point, if leftSum == rightSum, return the current index i as the equilibrium index.
If no equilibrium index is found after checking all indices, return -1.

Code

#include <bits/stdc++.h>
using namespace std;

// Function to find the equilibrium index in the array
int findEquilibriumIdx(int nums[], int n) {
    // Loop through each element of the array to check if it's the equilibrium index
    for (int i = 0; i < n; i++) {
        int leftSum = 0, rightSum = 0;

        // Calculate the sum of elements on the left side of the current index
        for (int j = 0; j < i; j++) {
            leftSum += nums[j];
        }

        // Calculate the sum of elements on the right side of the current index
        for (int j = i + 1; j < n; j++) {
            rightSum += nums[j];
        }

        // Check if the left sum equals the right sum
        if (leftSum == rightSum) {
            return i;  // Return the equilibrium index
        }
    }
    return -1;  // Return -1 if no equilibrium index is found
}

int main() {
    int n = 5;  // Size of the array
    int arr[] = {2, 3, -1, 8, 4};  // Array with values
    int equilibriumidx = findEquilibriumIdx(arr, n);  // Call the function 