| No. I had to quit coffee earlier this year because a single cup in the morning was keeping me up at night. But, let's be honest: One of the questions that I solved was basically "detect if a string is an anagram of another string." So cat -> act: true, cat -> dog: false. This was just a matter of treating the string as a series of characters, sorting them, and putting them back into a string. Then, if it's an anagram, the two sorted strings match. Can you solve that in under an hour? Specifically, can you solve that in under an hour when you can choose from 20 popular programming languages and unit tests are provided? More specifically, if you've been professionally programming every day for ~20 years, can you solve that in an hour? |