Keep Multiplying Found Values by Two

Repeatedly double the given integer while its current value exists in the array, and return the first value that is not found. The core challenge is efficient membership checking (typically via a hash set) to iterate until the value is absent.