i wonder about the definition of "easy" vs. "hard" questions. it seems to me that this is problematic. i mean, is there a well accepted mapping of all computer

i wonder about the definition of "easy" vs. "hard" questions. it seems to me that this is problematic. i mean, is there a well accepted mapping of all computer science related questions to a numerical difficulty rank? i mean what if we did that for math? some people would be good at geometry questions, others at algebra, others at topology, real analysis, etc. what if some great geometer interviews with a fanatical algebraist and then fails to make the cut? this candidate is a great geometer! were the questions "too hard"?