2 ms·
You won't because it's a toy problem, not because it something only greybeards did in libraries written decades ago. Asking someone to describe the simplest po
by monocasa 8y ago
You won't because it's a toy problem, not because it something only greybeards did in libraries written decades ago.
Asking someone to describe the simplest possible transformations on one of the simplest data structures isn't a stretch, and this is coming from someone without a CS degree.
EDIT: And that's not to say Google doesn't have a screwed up hiring system. I know someone who implemented a dynamic programming problem correctly, with the appropriate big O complexity, but was rejected because the constant time factor was slightly higher than what the interviewer was looking for. That's a BS decision; Max Howell's was not.