Algo.Java.BitmaskForEvens

To Everyone using nums[ i ] % 2 == 0 to check for even element. Use bitmask to determine even numbers which is fast computation wise.
( nums[ i ] & 0x1 ) == 0 instead of nums[ i ] % 2 == 0