Algo Deck: an open-source collection of 200 cards on algorithms

Unpopular opinion: Programmer time is more valuable than machine time. Maintenance is 90% of the life of a system. Therefore, just know the concepts for each .md file, be able to describe their general properties, and be able to work with existing implementations in the real world. Formal complexity is rarely useful, because on cheap hardware very inefficient code scales very well. Certainly, don&#x27;t re-implement basics like sort, graph traversal or queuing algorithms unless there is a pressing need.<p>For example, it is infinitely more useful (faster implementations, more proven code, less maintenance overhead, free upgrades) to be familiar with <i>iconv</i> and the data available in the Unicode database than to memorize random facts about encodings.

As somebody that interviews a lot of candidates, I almost never ask rote memorization questions like these. I have to wonder, are there people who do? What sort of signal do you hope to gather by doing so?

<i>boolean checkExactlyOneBitSet(int num) {</i><p><i>return (num &amp; (num - 1)) == 0;</i><p><i>}</i><p>That looks like it&#x27;ll fail when num == 0. I think it should be:<p><pre><code> return num &amp;&amp; ((num &amp; (num - 1)) == 0);</code></pre>

I followed the link for Anki on the iPhone and it’s $25. No other options?