I’m stumped on this problem: Given an array, check that every number switches from even to odd. All numbers in the array are positive integers. If there is a number that breaks the pattern, return the index of that number. If there aren’t any numbers that break the pattern, return a -1 Example arrays +… Read More Given an array, check that the pattern of even then odd is upheld

I came across this piece of code on reddit 1 – ((num & 1) << 1) as i32 This code returns 1 for even numbers and -1 for odd numbers. It takes less instructions than other ways of calculating the same thing, and is presumably, quite fast. So, how does it work? (A step-by-step breakdown… Read More How does this code check for parity of a number? (even or odd)