<story><title>Common Algo Problem Solutions</title><url>https://github.com/sherxon/AlgoDS/blob/master/README.md</url></story><parent_chain></parent_chain><comment><author>elbigbad</author><text>So are these just copied from leetcode? For example, leetcode&amp;#x27;s hamming distance versus yours:&lt;p&gt;LeetCode:&lt;p&gt;The Hamming distance between two integers is the number of positions at which the corresponding bits are different.&lt;p&gt;Given two integers x and y, calculate the Hamming distance.&lt;p&gt;Yours:&lt;p&gt;1)&lt;i&gt;&lt;/i&gt;Hamming Distance&lt;i&gt;&lt;/i&gt;
The Hamming distance between two integers is the number of positions at which the corresponding bits are different.
Given two integers x and y, calculate the Hamming distance.&lt;p&gt;Another one, LeetCode:&lt;p&gt;Given an array of integers, every element appears twice except for one. Find that single one.&lt;p&gt;Note:
Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?&lt;p&gt;Yours:&lt;p&gt;2)&lt;i&gt;&lt;/i&gt;Single Number&lt;i&gt;&lt;/i&gt;
Given an array of integers, every element appears twice except for one. Find that single one.
Note:Your algorithm should have a linear runtime complexity. Could you implement it without using extra memory?</text></comment>
<story><title>Common Algo Problem Solutions</title><url>https://github.com/sherxon/AlgoDS/blob/master/README.md</url></story><parent_chain></parent_chain><comment><author>lsiebert</author><text>First this doesn&amp;#x27;t include any statements of the specifics of the algorithm problems, which can be extremely relevant.  Second there are errors, for example the code the return all duplicates in array is just broken, and even if you fix the obvious errors like indexing and modifying the array you are examining, it will still not handle values of 0 or less.</text></comment>