HackerEarth_Codemonk_solution_Minimum-AND-xor-OR.cpp

#include <bits/stdc++.h>

typedef unsigned long long ull;

using namespace std;

int main () {
  ull test_cases;
  cin >> test_cases;

  while (test_cases--) {
    ull num_elem;
    cin >> num_elem;

    vector<ull> elems(num_elem, 0);
    for (ull i = 0; i < num_elem; ++i) {
      cin >> elems[i];
    }

    sort(elems.begin(), elems.end());

    ull min_xor = numeric_limits<ull>::max();
    for (ull i = 1; i < num_elem; ++i) {
      // min_xor = min(min_xor, (elems[i - 1] & elems[i]) ^ (elems[i - 1] | elems[i]));
      min_xor = min(min_xor, elems[i - 1] ^ elems[i]);
      if (min_xor == 0) {
        break;
      }
    }

    cout << min_xor << endl;
  }

  return 0;
}