🎓 Dr. Freemo :jpf: 🇳🇱 on Nostr: npub1gmnpw…ta4fp Usually if the interviewee is struggling or stressed I will remind ...
npub1gmnpwkk0mgtyjm8fdpwcpe7y7hzlkpecg7jeyssg8y6u7v6t5ypq2ta4fp (npub1gmn…a4fp) Usually if the interviewee is struggling or stressed I will remind them of this story, that I have had people who couldnt answer a single question that I've hired and that I care more about how they reason their way through a problem than what they know... so hopefully that helps the unequal treatment somewhat.
As for some of the questions I ask, I usually have a range of them from simple, to advanced but most of them are designed to have multiple levels of answers.
Also keep in mind since ive worked in so many diverse fields, usually as the boss, that the questions vary dramatically based on the field. Hiring chemists are very different questions than programmers, or medical doctors, or electrical engineers. So its hard to give you good examples that really covers the gammut.
I think you're a programmer IIRC so let me give you some examples from there:
On the whiteboard, in psuedocode, write for me an algorithm that will check if a number is prime. How would you be able to optimize it if you were asked to generate a bin of primes rather than to test for prime?
What is the difference between little-O, big-O little-omega and big-omega?
How would you evaluate a conventionally written algorithm to determine if it is likely to be suitable for GPU acceleration?
What is the fork-join pattern useful for and why is it so important?
As for some of the questions I ask, I usually have a range of them from simple, to advanced but most of them are designed to have multiple levels of answers.
Also keep in mind since ive worked in so many diverse fields, usually as the boss, that the questions vary dramatically based on the field. Hiring chemists are very different questions than programmers, or medical doctors, or electrical engineers. So its hard to give you good examples that really covers the gammut.
I think you're a programmer IIRC so let me give you some examples from there:
On the whiteboard, in psuedocode, write for me an algorithm that will check if a number is prime. How would you be able to optimize it if you were asked to generate a bin of primes rather than to test for prime?
What is the difference between little-O, big-O little-omega and big-omega?
How would you evaluate a conventionally written algorithm to determine if it is likely to be suitable for GPU acceleration?
What is the fork-join pattern useful for and why is it so important?