I submitted a resume online to the Google/SketchUp Boulder office on Pearl Street. I had an initial phone screening discussing past work history and some development and programming questions that were somewhat perfunctory.

I came in for an in-person interview. The office is a very stylish loft above retail on Pearl Street, basically the startup with too much money dream office: huge double monitors, fast workstations, a slack dress code, an unused foosball table, etc. Lunch was catered in daily, apparently from a posh catering company, and the food was excellent.

I interviewed with one of the SketchUp founders who clearly thought very highly of himself.

The position was for implementing extensions to the JavaScript interpreter scripting engine for SketchUp.

Given a large dataset that essentially consumes all working memory, what kind of sort would one implement?

Now add the condition that the elements are alphanumeric and the same length.