I went into a technical interview once and started solving a word search problem with a btree. I started with p-lists, and assembled the tree with tuples of tup

I went into a technical interview once and started solving a word search problem with a btree. I started with p-lists, and assembled the tree with tuples of tuples, assuming this was a starter data structure implementation that, after they added some constraint that would eliminate it as an option, i would easily modify. Well, my interviewers didnt know what p-lists were because they only knew javascript. They thought I was retarded and I didnt get the job.