jmaley

BFS is a 4 line algorithm that doesn't need to be memorized. I wouldn't trust a developer who can't even reason this out with understanding runtime order complexity.

  bool bfs(int x) {
    q = new LinkedList<Node>;
    q.push(root)
    while (q.size != 0 && q.peak() != x);
    return q.size ? true : false;
  }

Consider a scenario where the developer is required to write a custom directory tree. Each row contains a caret and a checkbox. When either of these are clicked, you'll need to perform some sort of tree traversal to ensure integrity of the view -- for example, checking the checkbox on a row may require that all children as selected too. Additionally, you may need an upward traversal to the root to ensure the parents are either in a mixed or unchecked state.

If the developer doesn't understand performance (or at the very least, basic tree operations like searching/sorting/traversing), they're going to write some horrible code. Google and Bloomberg have their pick, they don't want a shitty developer.

TLDR: Doesn't know computer science fundamentals, doesn't get hired in a role that requires computer science fundamentals.

Is this Hacker News or Script-Kiddie News?

Here's my experience with Google in 2014:

At the beginning of my senior year in college, I sent them a resume containing my GPA (3.9/4.0) at a public school (Clemson).

I heard back from Google within a couple weeks, had a few phone interviews, and then they flew me out for an on-site interview.

I had friends with similar credentials, but lower GPAs (< 3.5/4.0) that never heard back from Google.

Having a degree or high GPA doesn't matter to them once you're interviewing, but its tough to even get an interview without one.