<story><title>I would like to share 500 Data Structure and Algorithms problems</title><text>You can find around 500+ data structure and algorithms problems here (http:&amp;#x2F;&amp;#x2F;www.techiedelight.com&amp;#x2F;list-of-problems&amp;#x2F;) that are helpful to improve your algorithmic skills and also to crack coding interview of top tech companies.&lt;p&gt;From: Discussion on reddit
https:&amp;#x2F;&amp;#x2F;www.reddit.com&amp;#x2F;r&amp;#x2F;learnprogramming&amp;#x2F;comments&amp;#x2F;86seey&amp;#x2F;i_would_like_to_share_500_data_structure_and&amp;#x2F;</text></story><parent_chain></parent_chain><comment><author>bigdido</author><text>The best such site IMO: &lt;a href=&quot;http:&amp;#x2F;&amp;#x2F;rosettacode.org&amp;#x2F;wiki&amp;#x2F;Category:Programming_Tasks&quot; rel=&quot;nofollow&quot;&gt;http:&amp;#x2F;&amp;#x2F;rosettacode.org&amp;#x2F;wiki&amp;#x2F;Category:Programming_Tasks&lt;/a&gt;</text></comment>
<story><title>I would like to share 500 Data Structure and Algorithms problems</title><text>You can find around 500+ data structure and algorithms problems here (http:&amp;#x2F;&amp;#x2F;www.techiedelight.com&amp;#x2F;list-of-problems&amp;#x2F;) that are helpful to improve your algorithmic skills and also to crack coding interview of top tech companies.&lt;p&gt;From: Discussion on reddit
https:&amp;#x2F;&amp;#x2F;www.reddit.com&amp;#x2F;r&amp;#x2F;learnprogramming&amp;#x2F;comments&amp;#x2F;86seey&amp;#x2F;i_would_like_to_share_500_data_structure_and&amp;#x2F;</text></story><parent_chain></parent_chain><comment><author>eesmith</author><text>In &lt;a href=&quot;http:&amp;#x2F;&amp;#x2F;www.techiedelight.com&amp;#x2F;count-set-bits-using-lookup-table&amp;#x2F;&quot; rel=&quot;nofollow&quot;&gt;http:&amp;#x2F;&amp;#x2F;www.techiedelight.com&amp;#x2F;count-set-bits-using-lookup-tab...&lt;/a&gt; , the solution does not appear to be portable, that is, it uses the right shift of a signed number, and the C specification says (from &lt;a href=&quot;http:&amp;#x2F;&amp;#x2F;www.open-std.org&amp;#x2F;jtc1&amp;#x2F;sc22&amp;#x2F;wg14&amp;#x2F;www&amp;#x2F;docs&amp;#x2F;n1336.pdf&quot; rel=&quot;nofollow&quot;&gt;http:&amp;#x2F;&amp;#x2F;www.open-std.org&amp;#x2F;jtc1&amp;#x2F;sc22&amp;#x2F;wg14&amp;#x2F;www&amp;#x2F;docs&amp;#x2F;n1336.pdf&lt;/a&gt; )&lt;p&gt;&amp;gt; The result of E1 &amp;gt;&amp;gt; E2 is E1 right-shifted E2 bit positions. ... If E1 has a signed type and a negative value, the resulting value is implementation-defined.&lt;p&gt;In practice it isn&amp;#x27;t a concern, as the most common compilers (gcc, clang, MSVC++) do what we expect.</text></comment>