Given an array arr of integers, check if there exist two indices i and j such that arr[i] == 2 * arr[j].The solution involves using a hash table to track the elements encountered while iterating through the array.For each element arr[i], we check if arr[i] * 2 or arr[i] / 2 (if arr[i] is even) is in the hash table.If a match is found, return true; otherwise, return false.