Below is a sample solution that utilizes bitwise operations: Bitwise operations can determine if a number is a power of 2. The key insight is that for a number n, if it is a power of 2, the expression n & (n - 1) will yield 0. def check_power_of_2 ( nums ) : result = [ ] for num in nums : if num != 0 and ( ( num & ( num - 1 ) ) == 0 ) : result . append ( 1 ) else : result . append ( 0 ) return result This function accepts a list of integers and checks each integer to see if it is a power of 2 by applying the bitwise 'AND' operation between the number and its predecessor. If the number is a power of two, it adds 1 to the 'result'; otherwise, it adds 0. At the end, the function returns the 'result' list.