<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[RSS Feed]]></title><description><![CDATA[RSS Feed]]></description><link>http://direct.ecency.com</link><image><url>http://direct.ecency.com/logo512.png</url><title>RSS Feed</title><link>http://direct.ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Fri, 10 Apr 2026 21:51:07 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/data-structures/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[One algorithm a day: Keeping track of the largest element in a stack]]></title><description><![CDATA[Imagine that you want to be able to access the largest element in a stack. I know you were dying to do it ! You already have implementation of the stack class: class Stack<Item> { // initialize an]]></description><link>http://direct.ecency.com/programming/@cryptoizotx/access-the-largest-element-in-a-stack</link><guid isPermaLink="true">http://direct.ecency.com/programming/@cryptoizotx/access-the-largest-element-in-a-stack</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[cryptoizotx]]></dc:creator><pubDate>Wed, 26 Dec 2018 17:00:15 GMT</pubDate></item><item><title><![CDATA[One algorithm a day.  Write a function that returns best profit you could made from trading.]]></title><description><![CDATA[Write an efficient function that takes stockPrices and returns the best profit I could have made from one purchase and one sale of one share of Apple stock yesterday. func getMaxProfit(_]]></description><link>http://direct.ecency.com/swift/@cryptoizotx/one-algorithm-a-day-write-a-function-that-returns-best-profit-you-could-made-from-trading</link><guid isPermaLink="true">http://direct.ecency.com/swift/@cryptoizotx/one-algorithm-a-day-write-a-function-that-returns-best-profit-you-could-made-from-trading</guid><category><![CDATA[swift]]></category><dc:creator><![CDATA[cryptoizotx]]></dc:creator><pubDate>Mon, 24 Dec 2018 02:04:30 GMT</pubDate></item><item><title><![CDATA[One algorithm a day: floor of the square root of the input]]></title><description><![CDATA[Description Implement a function that takes in a 32 bit integer and returns another 32 bit unsigned integer that is the floor of the square root of the input Implementation Function can be implemented]]></description><link>http://direct.ecency.com/programming/@cryptoizotx/one-algorithm-a-day-floor-of-the-square-root-of-the-input</link><guid isPermaLink="true">http://direct.ecency.com/programming/@cryptoizotx/one-algorithm-a-day-floor-of-the-square-root-of-the-input</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[cryptoizotx]]></dc:creator><pubDate>Sat, 22 Dec 2018 17:46:54 GMT</pubDate></item><item><title><![CDATA[Linked list]]></title><description><![CDATA[View post on dMania]]></description><link>http://direct.ecency.com/dmania/@jordaan01/linked-list-zg1hbmlh-pvetw</link><guid isPermaLink="true">http://direct.ecency.com/dmania/@jordaan01/linked-list-zg1hbmlh-pvetw</guid><category><![CDATA[dmania]]></category><dc:creator><![CDATA[jordaan01]]></dc:creator><pubDate>Mon, 14 May 2018 20:39:12 GMT</pubDate><enclosure url="https://images.ecency.com/p/MG5aEqKFcQiA7k3kupnAHCbxk1NjEFVU3fVmWuopJyJjt1rZrpMPJqjrzTJpPGdjwUnRNnv8hbwhMR82bAsqhoW1gdYDfwhHQ?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[The Sieve of Eratosthenes Part 1: efficiently generating primes up to n]]></title><description><![CDATA[The Sieve of Eratosthenes is an algorithm for finding prime numbers in a range. Conceptually, it's a very simple algorithm. Let's assume our range is always [2, n]. In our examples, we'll consider n=100. ]]></description><link>http://direct.ecency.com/programming/@ivlad/the-sieve-of-eratosthenes-part-1-efficiently-generating-primes-up-to-n</link><guid isPermaLink="true">http://direct.ecency.com/programming/@ivlad/the-sieve-of-eratosthenes-part-1-efficiently-generating-primes-up-to-n</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[ivlad]]></dc:creator><pubDate>Wed, 04 Apr 2018 10:15:48 GMT</pubDate><enclosure url="https://images.ecency.com/p/5k2tWE6P7gjtWGNDHKvBHJvQxDKSGhHqmhHd28cN?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[ACM题解系列之 - 最小堆栈 (Min Stack) - Design a Stack with constant time in Push, Pop and Min]]></title><description><![CDATA[Implement a stack with min() function, which will return the smallest number in the stack. It should support push, pop and min operation all in O(1) cost. class MinStack { public: MinStack() { // write]]></description><link>http://direct.ecency.com/programming/@justyy/acm-min-stack-design-a-stack-with-constant-time-in-push-pop-and-min</link><guid isPermaLink="true">http://direct.ecency.com/programming/@justyy/acm-min-stack-design-a-stack-with-constant-time-in-push-pop-and-min</guid><category><![CDATA[programming]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Fri, 23 Mar 2018 19:28:06 GMT</pubDate><enclosure url="https://images.ecency.com/p/8SzwQc8j2KJZzDMmiTpeGKqzhb5bZmUfRWRdWQfcYX9EVteXPjhCbVTBmZgi1WBcT9Ya5fw9Ry26qRu6dzYDUFZnwmSg4N5LYKatFaosDjxV3VKtLox?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[What's a Merkle Tree?]]></title><description><![CDATA[Each node in the Merkle tree performs MD5 hashing of input data. Parent nodes concatenate the hashes of their children before hashing. (Credit: T. L. Oliver CC BY-SA 4.0) If you've tried to understand]]></description><link>http://direct.ecency.com/computer-science/@black-ice/what-s-a-merkle-tree</link><guid isPermaLink="true">http://direct.ecency.com/computer-science/@black-ice/what-s-a-merkle-tree</guid><category><![CDATA[computer-science]]></category><dc:creator><![CDATA[black-ice]]></dc:creator><pubDate>Wed, 21 Feb 2018 00:07:00 GMT</pubDate><enclosure url="https://images.ecency.com/p/5k2tWE6P7gjtWGNDHKvBHJvQxA9PB5NnCCDhtqwt?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Why do we only use C in data structures and not C++?]]></title><description><![CDATA[Data Structures are particular way of organizing data in a computer so that it can be used efficiently. (Wikipedia Definition) So you can not state that it must be done only in one programming language,]]></description><link>http://direct.ecency.com/data-structures/@orcunland/why-do-we-only-use-c-in-data-structures-and-not-c</link><guid isPermaLink="true">http://direct.ecency.com/data-structures/@orcunland/why-do-we-only-use-c-in-data-structures-and-not-c</guid><category><![CDATA[data-structures]]></category><dc:creator><![CDATA[orcunland]]></dc:creator><pubDate>Mon, 19 Feb 2018 05:08:09 GMT</pubDate><enclosure url="https://images.ecency.com/p/gPCasciUWmF5VZucjWuzmpXUomGMznGBossB7LD36vcX8q1DBxzw65HsFWW2iVT1Ma2orCzUAeWNW9XSyCRxVmcVfx2WuSaPpjNgMuuXWTYFurTr4NVwjEzktPXLf4TedhLSQTo8ZaGLtRCWm4?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures in Python - Part 2 - Queues]]></title><description><![CDATA[Queues in Python A Queue A queue is another of the standard data structures that we find throughout Computer Science. Unlike the stack, the queue is a FIFO structure (First In First Out). The items which]]></description><link>http://direct.ecency.com/coding/@amos1969/data-structures-in-python-part-2-queues</link><guid isPermaLink="true">http://direct.ecency.com/coding/@amos1969/data-structures-in-python-part-2-queues</guid><category><![CDATA[coding]]></category><dc:creator><![CDATA[amos1969]]></dc:creator><pubDate>Sat, 03 Feb 2018 23:33:57 GMT</pubDate><enclosure url="https://images.ecency.com/p/4i88GgaV8qiGEw1xifwYz2xp7RJEnNpBZq7dn2K5zseKxAeEc6LthdkYU1n3Cd6VhwFwZhUw3bqzqTgNmspuhRUdUbDxxLwRh4B5UY4LmSd5jjDERWxAcFcEjQ?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Data Structures in Python - Part 1- Stacks]]></title><description><![CDATA[Stacks in Python A Stack A stack is a standard computer science data structure that can be described as LIFO (Last In First Out). We "stack" each data item on top of the previous one (actually]]></description><link>http://direct.ecency.com/coding/@amos1969/data-structures-in-python-part-1-stacks</link><guid isPermaLink="true">http://direct.ecency.com/coding/@amos1969/data-structures-in-python-part-1-stacks</guid><category><![CDATA[coding]]></category><dc:creator><![CDATA[amos1969]]></dc:creator><pubDate>Fri, 02 Feb 2018 17:03:48 GMT</pubDate><enclosure url="https://images.ecency.com/p/4i88GgaV8qiGEw1xifwYz2xp7RJEnNpBZq7dn2K62pLxvJhuFuqejWbfNatNWVSRFPFXu8b2vWYVUnaCvdQHiBSyoGtPwaYy86z8Hq84N6Diqg1C4nKdrKA8FQ?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>