The XOR operation (or exclusive
or) takes two bits and returns 1
if exactly one of the bits
is 1. Otherwise, it
1 ^ 1 → 0
1 ^ 0 → 1
0 ^ 1 → 1
0 ^ 0 → 0
Think of it like a bag of chips where only one hand can fit in at
a time. If no one reaches for chips, no one gets chips, and if
both people reach for chips, they can't fit and no one gets chips
When performing XOR on two integers, the XOR operation is
calculated on each pair of bits (the two bits at the same index in
5 ^ 6 # gives 3
# At the bit level:
# 0101 (5)
# ^ 0110 (6)
# = 0011 (3)
Actually, we don't support password-based login. Never have. Just the OAuth methods above. Why?
It's easy and quick. No "reset password" flow. No password to forget.
It lets us avoid storing passwords that hackers could access and use to try to log into our users' email or bank accounts.
It makes it harder for one person to share a paid Interview Cake account with multiple people.
“I'd like to thank you for this program. Interview Cake is a really awesome tool for validating and reviewing concepts. It's also very efficient in the sense that it covers a wide variety of topics with a very elegant and consistent approach.