For example, if asked "how would you detect a cycle in a linked list?" you might memorise "Tortoise and hare algorithm, two pointers one slow and one fast, fast

For example, if asked "how would you detect a cycle in a linked list?" you might memorise "Tortoise and hare algorithm, two pointers one slow and one fast, fast overtaking slow indicates the presence of a cycle" A person with a deep passion for algorithms might be tempted to try to solve it themselves before checking the answer - which can be a time consuming business. Time your competitors have used to memorised the answers to 25 more questions. ldjkfkdsjnv has exaggerated a bit, to be provocative - but I've certainly had interviewers ask me questions that stumped the greatest minds in computer science for 25+ years; I don't know what they were expecting if not memorisation.