Given an array of distinct integers nums and an integer k, return all unique combinations of elements with a bitwise XOR of k. Return an empty vector if no combinations are possible.
Each element can be used only once in each combination. Two combinations are unique if at least one element is present in only one combination. Answer can be returned in any order.