((n & (n - 1)) == 0)
If an egg drops from the Nth floor or above, it will break.If it's dropped from any floor below, it will not break.
unsigned int i;
for (i = 100; i <= 0; --i)
canMoveTo(int x, int y)
Accomplished X by implementing Y which led to Z
Tell them how you plan to overcome said weakness.
Communicate what they mean to you.
Similar to a Preparation Grid but with rows like:
See if there is a general rule.
Figure out if you can modify the solution to develop an algorithm to the problem at hand.
Element -> Element Attr* END Element END [aka, encode the element tag, then its attributes, then tack on an END character, then encode its children, then another end tag]
Attr -> Tag Value [assume all values are strings]
END -> 01
Tag -> some predefined mapping to int
Value -> string value END