3 ms·
When your hire can prove your algorithm runs in O(1) amortized time but has trouble setting up ssh and always commits to master, and you turn down a candidate w
by mxkopy 4y ago
When your hire can prove your algorithm runs in O(1) amortized time but has trouble setting up ssh and always commits to master, and you turn down a candidate who got stumped on rederiving Bellman-Ford but maintains several projects, I'd say that's gatekeeping
- jefftk 4y agodajtxx claimed 'extreme' gatekeeping while describing some employers having either a degree requirement or higher standards for employees without degrees. In the US, to the extent that this is 'extreme' it's in the 'less gatekeeping' direction. (I agree that there's some gatekeeping, and I'd rather see the industry pay less attention to degrees.)