Diffk II Time : Space : 123456789int Solution::diffPossible(const vector<int> &A, int B) { unordered_set<int> us; for(auto a : A) { if(us.count(a+B) or us.count(a-B)) return true; us.insert(a); } return false;}