IBM exam

Telegram:- @allcoding1

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

int gcd(int a, int b) {
    while (b != 0) {
        int temp = b;
        b = a % b;
        a = temp;
    }
    return a;
}

vector<int> gcdArrays(vector<int>& arr) {
    int n = arr.size();
    int max_gcd = 0;
    int max_length = 0;

    for (int i = 0; i < n - 1; ++i) {
        int current_gcd = arr[i];
        for (int j = i + 1; j < n; ++j) {
            current_gcd = gcd(current_gcd, arr[j]);
            if (current_gcd > max_gcd) {
                max_gcd = current_gcd;
                max_length = j - i + 1;
            } else if (current_gcd == max_gcd && (j - i + 1) > max_length) {
                max_length = j - i + 1;
            }
        }
    }

    return {max_gcd, max_length};
}

DE Shaw

Telegram:- @allcoding1