OA Help : Interview Help

#include <bits/stdc++.h> using namespace std; #define int long long #define tCases \ int tcc; \ cin >> tcc; \ while (tcc--) void B() { int n; cin >> n; vector<int> arr(n * 2); for (int i = 0; i < n * 2; i++) cin >> arr[i]; sort(arr.begin(), arr.end()); cout << arr[n - 1] - arr[0] + arr[2 * n - 1] - arr[n] << endl; for (int i = 0; i < n; i++) cout << arr[i] << ' ' << arr[i + n] << endl; } signed main() { tCases answer(); return 0; } // B

#include <bits/stdc++.h> using namespace std; #define int long long #define t \ int tc; \ cin >> tc; \ while (tc--) void code() { int x, y, k; cin >> x >> y >> k; if (x >= y) cout << x << endl; else if (x + k >= y) cout << y << endl; else { x += k; y += (y - x); cout << y << endl; } } signed main() { t code(); return 0; } // A

Codeforces B done ✅

Codeforces A done ✅ dm @cp_wala

Load Balancer PayPal done ✅

Div 2 A,B,C done ✅ Playing with OR Guess the winner! Save People These done ✅ Dm fast ⏳ All for 30 ❤️‍🔥

Playing with OR done ✅

C done ✅

B done ✅

Codeforces A done ✅ @cp_wala

Codeforces C done ✅😍 DM fast, time's running

CF a and B done ✅ DM fast

Leetcode 3rd done ✅😍 Dm fast

LEETCODE A and B done ✅😍 DM fast

100094. Subarrays Distinct Element Sum of Squares I Done ✅ Dm @cp_wala

Wishcraft only in 11rs ✅ all tcs passed

Wishcraft done ✅

#include <bits/stdc++.h> using namespace std; #pragma GCC target("popcnt") #define int long long #define tccc \ int t; \ cin >> t; \ while (t--) void DUPLET() { int n; cin >> n; if (n % 2 == 0) cout << n << ' ' << n + 1 << endl; else cout << n << ' ' << n - 1 << endl; } signed main() { tccc DUPLET(); return 0; }