jmaley

3 ms·

1. 1.▲
   by jmaley 10y ago

   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>;
2. 2.▲
   by jmaley 10y ago

   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
3. 3.▲
   by jmaley 10y ago

   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?
4. 4.▲
   by jmaley 11y ago

   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 phon