TIL the INTERCAL ~ "select" operator (c.1972) has existed as an x86 cpu instruction, "PEXT", since haswell (c.2013).
it's apparently heavily used in chess engines, for compression of chessboards or something.

seen from United States

seen from United States
seen from Portugal
seen from France
seen from Türkiye
seen from Canada
seen from United States

seen from United States

seen from Malaysia

seen from United States

seen from United States
seen from United States
seen from China

seen from United States
seen from United States
seen from United States
seen from China
seen from China
seen from Japan
seen from United States
TIL the INTERCAL ~ "select" operator (c.1972) has existed as an x86 cpu instruction, "PEXT", since haswell (c.2013).
it's apparently heavily used in chess engines, for compression of chessboards or something.
Bit Twiddling Hacks
Most interviews will have some sort of bit manipulation questions.
Knowing some basic bit manipulation results will help solve them quicker.
It is like knowing standard rules. There are many resources online.
The best i know is http://graphics.stanford.edu/~seander/bithacks.html#BitReverseObvious
My suggestion would be to use C to solve these bit manipulation questions.
Java may trouble you with unsigned data types.
Still relevant: a treasure trove of bit-twiddling hacks. Super useful if you're doing lots of bit operations on a general-purpose processor or microcontroller (say, forward error correction coding).