AgentIcarus
Joined 17 years ago
Karma
193
Submissions
30
Member since
Jan 10
Joined 17 years ago
I find it very hard to interpolate between these examples. And none of them are "hard"! I haven't written an OS or a more efficient linked list. All I've done is plugged away at something until it works.
Anything less than O(n) obviously means not needing to look at every element of the input, i.e. it's already sorted or similar. For most other interview problems that seems like a reasonable lower bound in the absence of more detailed analysis. I guess the recruiter's advice to go practice on TopCoder wasn't just copy-paste.
Plenty of software architecture and design experience especially wrt distributed systems.
Learning CloudFormation.
Previous: 2013 - 2017 Football Radar 2010 - 2012 Google 2009 - 2010 Taptu 2008 - 2008 Spektrix 2007 - 2008 ORC Software 2004 - 2007 MXTelecom