> The industry is awash with candidates with ok-seeming resumes, that get through HR screening, but then fail miserably at the tech interview to solve something

> The industry is awash with candidates with ok-seeming resumes, that get through HR screening, but then fail miserably at the tech interview to solve something like fizzbuzz. > My anecdotal experience is that you never want people who can't write a for-loop or whatever in your team, whatever you are doing! Your comment shows that this topic has a false assumption. There is not one type of hiring process. Not even when we talk about algorithm/data structure style coding interviews. How do I know? Because if you don't know how to do a topological sort and similar algorithms on that level, you stand no chance at FAANG interviews. I remember the time where I found fizzbuzz doable but difficult. I could do it, I was simply slow at it. When I prepped myself for a FAANG interview, I did fizzbuzz at the end of it for fun since I hadn't done it in years. The result: fizzbuzz was done very very quickly and I'd classify it as a Leetcode easy. The thing is, Leetcode hard is a different beast [1]. Therefore, I'd argue it's also a different hiring process. [1] Here is how I look at the Leetcode difficulty levels (the TL;DR version). Leetcode easy: can you write a for loop? Do you know what a function is? What about if-statements and variables? Leetcode medium: can you reasonably think about data structures and write it out in code? Leetcode hard: do you see the ingenious trick (or tricks) being employed? Do you have advanced knowledge of data structures? If so, congratulations! The hard part is over. You just need to code it out. Example: you need to know this type of stuff: https://www.youtube.com/watch?v=cIBFEhD77b4 https://www.youtube.com/watch?v=cIBFEhD77b4 <-- It's a good YT channel by the way. After his video series/lectures on graphs, I was able to solve 50% Leetcode hard on graph problems :)