I had a candidate totally fail the algorithm interview. Is a binary tree balanced? I thumbs downed him. I was overruled and he was hired based off of his crede

I had a candidate totally fail the algorithm interview. Is a binary tree balanced? I thumbs downed him. I was overruled and he was hired based off of his credentials, resume and what he talked about in the interview with another person who just had a talk about "architecture." Turns out the guy can't even code. He constantly just talks about architecture and tries to tell everyone to completely change the architecture to be event driven. But when given an assignment to work on the actual product he totally fails. It's crazy, the man is a complete clown. Here's what I think. You can't hire a candidate based off of just a technical interview alone. But you can't just hire a candidate off of his credentials either. There's too much room for lies and deception in this area. You need both metrics in order to get the most information out of a candidate. It goes both ways. The Technical Interview was invented because of too much of the above problem. People who are charismatic and exaggerate their resume and turn out not being able to code. Of course nowadays with canned memorization going rampant and technical interviews becoming IQ tests there's really no accurate way measuring a candidate. I'll just say that as bad as an IQ test is in identifying good programmers who are bad at IQ tests, a person with high IQ is likely going to be a good programmer.