<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Interview on Andrew Walsh</title><link>http://awalsh128.com/tags/interview/</link><description>Recent content in Interview on Andrew Walsh</description><generator>Hugo -- gohugo.io</generator><language>en-US</language><copyright>© 2026 Andrew Walsh</copyright><lastBuildDate>Mon, 14 Feb 2022 00:00:01 -0700</lastBuildDate><atom:link href="http://awalsh128.com/tags/interview/feed.xml" rel="self" type="application/rss+xml"/><item><title>Interviews are the Worst</title><link>http://awalsh128.com/interviews-are-the-worst/</link><pubDate>Mon, 14 Feb 2022 00:00:00 -0800</pubDate><guid>http://awalsh128.com/interviews-are-the-worst/</guid><description>&lt;p&gt;If you have experience in the software engineering field, an interview process can test the experience you have; projects, production scenarios, designs. Unfortunately, for junior positions and those out of college, there isn&amp;rsquo;t much to test for. Since most are computer scientists, you could test knowledge of algorithms and data structures but does that really prove the ability of a candidate? Knowing the upper bound complexity of an algorithm&amp;rsquo;s runtime is important but what about when a constant multiplying factor means the difference between production being up and down. We don&amp;rsquo;t have a solution for the Traveling Salesman Problem but we have very good and practical approximations (e.g. flight scheduling).&lt;/p&gt;</description></item></channel></rss>