Pretend I am a 5 year old and explain what an NP-complete problem is.
Sigiloso
I'm not sure if this is a good or bad question. Explaining the class NP can be tricky even if your audience is upper-division CS majors at a top school. Avoiding that mess and still giving a simple, correct answer (focusing on completeness) may not even require a correct understanding of NP. If someone asked me this, I'd probably get meta-interview and ask why it was a good question.