My highlight are

  During his own Google interview, Jeff Dean was asked the implications if P=NP were true. He said "P = 0 or N = 1." Then, before the interviewer had even finished laughing, Jeff examined Google's public certificate and wrote the private key on the whiteboard.

  Jeff Dean wrote an O(n^2) algorithm once. It was for the Traveling Salesman Problem

I read it more as a parody of The Most Interesting Man in the World as opposed to Chuck Norris.