ATS resume help

C++❤️✅

#include <bits/stdc++.h> using namespace std; #define ll long long ll mod = 1e9+7; int gcd(int a, int b) { if(a == 0) return b; return gcd(b%a, a); } int main() { int n; cin >> n; vector<int> arr(n); for(int i = 0; i < n; i++) cin >> arr[i]; for(int i = 1; i < n; i++) { bool flag = true; for(int j = 0; j < i; j++) { for(int k = i; k < n; k++) { if(gcd(arr[j], arr[k]) > 1) { flag = false; break; } } if(flag == false) break; } if(flag) { cout << i; return 0; } } cout << n; return 0; }

tim code -python

tim code -python

Dr strange code -tcs python @CodingPalace ✅✅

we will post all solutions 😊 @CodingPalace❤️ @CodingPalace share ✅  share ✅ share✅ our channel 😊 Show some love and support guys😁😁😊👍👍

Frequency code Tcs code

Afternoon slot... Accenture exam got selected😎 @placementsBro

Accenture 2nd round both codes done successfully 🥳🥳 2pm slot ❤️✅

Accenture 2:00 pm slot cleared round-1 successfully ❤️✅🥳🥳

Accenture help going on ❤️✅

First round Cleared 👍 Accenture

Qualified for 2nd round 🤩🤩