<?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>Sun, 12 Apr 2026 04:37:35 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/datastructures/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[DSA (Medium) - General - Print A Diamond Shape (Typescript, Python & Rust)]]></title><description><![CDATA[Given the following shape: [LOG]: " A" [LOG]: " B B" [LOG]: " C C" [LOG]: " D D" [LOG]: " E E" [LOG]: "F F" [LOG]: " E E" [LOG]: "]]></description><link>http://direct.ecency.com/algorithms/@simplestack/dsa-medium-general-print-a-diamond-shape-typescript-python-and-rust</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/dsa-medium-general-print-a-diamond-shape-typescript-python-and-rust</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Tue, 01 Apr 2025 17:20:51 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRTkx1LDoUiAcMGhpwSL3cpFASQ9fCLsbvAniREoJrgZmmWfcddwUDBfA78yh2VgA3DYh9WaLATHiqakbNqDEpH3dHve?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Medium) — Binary Tree — Lowest Common Ancestor of a Binary Tree (Python, Typescript & Rust)]]></title><description><![CDATA[Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of LCA on Wikipedia: “The lowest common ancestor is defined between two nodes p and]]></description><link>http://direct.ecency.com/algorithms/@simplestack/dsa-medium-binary-tree-lowest-common-ancestor-of-a-binary-tree</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/dsa-medium-binary-tree-lowest-common-ancestor-of-a-binary-tree</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Mon, 31 Mar 2025 15:01:27 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRTqH16jWfmW6inSisW8YVsxuQrLsRzWH6wmBArwTU4yrqbaPP2wmRBgRiXejRokwww5gBiMSKz1P9GxAzPvYHrXfPiN?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[The Flowerbed Challenge: Can You Plant Them All? (Python, Typescript, Golang)]]></title><description><![CDATA[Let flowerbed be an integer array representing a flowerbed, where 0 denotes an empty plot and 1 denotes a planted plot. Determine whether it is possible to plant n additional flowers in the flowerbed such]]></description><link>http://direct.ecency.com/algorithms/@simplestack/the-flowerbed-challenge-can-you-plant-them-all-python-typescript-golang</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/the-flowerbed-challenge-can-you-plant-them-all-python-typescript-golang</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Fri, 28 Mar 2025 01:01:09 GMT</pubDate><enclosure url="https://images.ecency.com/p/8DAuGnTQCLptZgjHUrRAJGcW4y1D4A5QVJJ7zjzqqKdfVHSS6NapSCCBeZkxEv9MKE2xvUXNqEjHBfFqU5o917DUSoP5MA153stoFbeEQxdt85bKfG9deRKe1tc3XC1SnnNavJkxKyop5T3GMuYxPFC8Z1poZXtShUVZEDRKJc6?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Medium) — Equal Row and Column Pairs (Python, TS & Go)]]></title><description><![CDATA[Given a 0-indexed n x n integer matrix grid, return the number of pairs (ri, cj) such that row ri and column cj are equal. A row and column pair is considered equal if they contain the same elements in]]></description><link>http://direct.ecency.com/softwaredevelopment/@simplestack/dsa-medium-equal-row-and-column-pairs-python-ts-and-go</link><guid isPermaLink="true">http://direct.ecency.com/softwaredevelopment/@simplestack/dsa-medium-equal-row-and-column-pairs-python-ts-and-go</guid><category><![CDATA[softwaredevelopment]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Thu, 27 Mar 2025 20:52:18 GMT</pubDate><enclosure url="https://images.ecency.com/p/8DAuGnTQCLptZgjHUrRAJGcW4y1D4A5QVJJ7zjzqqKdfVHSS6NapSCCBeZkxEv9MKE2xvUXNqEj6WKGUXYChvZzaQo6b12o3HcsZVdTSN29jADmJa9Y85FvNdq8Rtu2Ht9dYjKV2jEKVEp5r5FBXzeq2gnbCDmx31HPscd4NYBG?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Interviewer: Write A Function That Always Picks The Best Move in a Game of Nim (Hard) - Python]]></title><description><![CDATA[Imagine you have a few piles of sticks. Two players take turns picking sticks. On your turn, you must choose one pile and take at least one stick from that pile (you can take as many as you want from that]]></description><link>http://direct.ecency.com/softwaredevelopment/@simplestack/interviewer-write-a-function-that-always-picks-the-best-move-in-a-game-of-nim-hard-python</link><guid isPermaLink="true">http://direct.ecency.com/softwaredevelopment/@simplestack/interviewer-write-a-function-that-always-picks-the-best-move-in-a-game-of-nim-hard-python</guid><category><![CDATA[softwaredevelopment]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Thu, 27 Mar 2025 18:34:06 GMT</pubDate><enclosure url="https://images.ecency.com/p/8DAuGnTQCLptZgjHUrRAJGcW4y1D4A5QVJJ7zjzqqKdfVHSS6NapSCCBeZkxEv9MKE2xvUXNqEjqc3bZH4uvz6bsL7WDpWcaqmhQDAG2UQ3a8LLMD5jfrXJob8E7jGDhY3Jjr9ounvNzGtbqbe3LEvdTzJ8dK3hm7Qb14hkB9nN?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Easy) — Sets — Find the Difference of Two Arrays (Python, Typescript & Go)]]></title><description><![CDATA[Given two 0-indexed integer arrays nums1 and nums2, return a list answer of size 2 where: answer[0] is a list of all distinct integers in nums1 which are not present in nums2. answer[1] is a list of all]]></description><link>http://direct.ecency.com/softwaredevelopment/@simplestack/dsa-easy-sets-find-the-difference-of-two-arrays-python-typescript-and-go</link><guid isPermaLink="true">http://direct.ecency.com/softwaredevelopment/@simplestack/dsa-easy-sets-find-the-difference-of-two-arrays-python-typescript-and-go</guid><category><![CDATA[softwaredevelopment]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Thu, 27 Mar 2025 17:50:00 GMT</pubDate><enclosure url="https://images.ecency.com/p/8DAuGnTQCLptZgjHUrRAJGcW4y1D4A5QVJJ7zjzqqKdfVHSS6NapSCCBeZkxEv9MKE2xvUXNqEkQPZwjeTk2sNsqEW1VbizCiwwGKaF8rqT83Q23jqCTP8XmySvtrfUwEAXTzEuSSQN2KUkq56rCpYUThNVutuSsZuq25Rd1Epn?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Medium) — Linked List — Delete the Middle Node of a Linked List (Python, Typescript & Go)]]></title><description><![CDATA[You are given the head of a linked list. Delete the middle node, and return the head of the modified linked list. The middle node of a linked list of size n is the ⌊n / 2⌋th node from the start using 0-based]]></description><link>http://direct.ecency.com/softwaredevelopment/@simplestack/dsa-medium-linked-list-delete-the-middle-node-of-a-linked-list-python-typescript-and-go</link><guid isPermaLink="true">http://direct.ecency.com/softwaredevelopment/@simplestack/dsa-medium-linked-list-delete-the-middle-node-of-a-linked-list-python-typescript-and-go</guid><category><![CDATA[softwaredevelopment]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Thu, 27 Mar 2025 17:17:06 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRTqH16jkjiMkGG8Swvr3n6krs6AFQ4eZckHNZWBhdXZ3WAkpnjvmjii2zDXmivZbtVNtSArJx5RmB8qz6sTUhCTzFCA?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Medium) — Determine if Two Strings Are Close (Python, TS & Go)]]></title><description><![CDATA[Two strings are considered close if you can attain one from the other using the following operations: Operation 1: Swap any two existing characters. For example, abcde -> aecdb Operation 2: Transform]]></description><link>http://direct.ecency.com/softwaredevelopment/@simplestack/dsa-medium-determine-if-two-strings-are-close-python-ts-and-go</link><guid isPermaLink="true">http://direct.ecency.com/softwaredevelopment/@simplestack/dsa-medium-determine-if-two-strings-are-close-python-ts-and-go</guid><category><![CDATA[softwaredevelopment]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Thu, 27 Mar 2025 16:34:54 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRTjeNmdvdcj5Ytrv9i3g3tL5ALKbSiLq6MvwfXG3NuK8hL6VKVqTFXMhFB6dSfsLsqntbUt3k6DWZHjR8GUrDvwJ6mL?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Easy) —Linked List — Reverse Linked List (Python, Typescript & Go)]]></title><description><![CDATA[Given the head of a singly linked list, reverse the list, and return the reversed list. Example 1: Input: head = [1,2,3,4,5] Output: [5,4,3,2,1] Example 2: Input: head = [1,2] Output: [2,1] Example 3:]]></description><link>http://direct.ecency.com/softwaredevelopment/@simplestack/dsa-easy-linked-list-reverse-linked-list-python-typescript-and-go</link><guid isPermaLink="true">http://direct.ecency.com/softwaredevelopment/@simplestack/dsa-easy-linked-list-reverse-linked-list-python-typescript-and-go</guid><category><![CDATA[softwaredevelopment]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Thu, 27 Mar 2025 15:59:12 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRTm3mYy3bDTudrZ4RFffB292H7mJQjyAUhbSouQ39ZsexXpz8AzCmrV1PyGAgr6nZZMd7hhcpkQd2EWKQ4juJMgCoJn?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Easy) — Binary Tree — Maximum Depth of Binary Tree (Python, Typescript & Go)]]></title><description><![CDATA[Given the root of a binary tree, return its maximum depth. A binary tree’s maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. Example 1: Input:]]></description><link>http://direct.ecency.com/softwaredevelopment/@simplestack/dsa-easy-binary-tree-maximum-depth-of-binary-tree-python-typescript-and-go</link><guid isPermaLink="true">http://direct.ecency.com/softwaredevelopment/@simplestack/dsa-easy-binary-tree-maximum-depth-of-binary-tree-python-typescript-and-go</guid><category><![CDATA[softwaredevelopment]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Thu, 27 Mar 2025 01:56:33 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRU96mbjBDdqFEA3LTzqS9QxVLRiGDoUeDdofVidEZNeMP2psysRD5WP7QKeW2rYnuE9cuQ873HtyGo1v9TYGUVJ9V2n?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Medium) — Queue — Dota2 Senate]]></title><description><![CDATA[The Dota2 senate consists of senators coming from two parties. Now the Senate wants to decide on a change in the Dota2 game. The voting for this change is a round-based procedure. In each round, each senator]]></description><link>http://direct.ecency.com/softwaredevelopment/@simplestack/dsa-medium-queue-dota2-senate</link><guid isPermaLink="true">http://direct.ecency.com/softwaredevelopment/@simplestack/dsa-medium-queue-dota2-senate</guid><category><![CDATA[softwaredevelopment]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Thu, 27 Mar 2025 01:43:54 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRTRGLbREvetptTapzM1NnVkECijVE9LWiEFg3zuKwix22VjtFxQgtUomLxpYb2v2THcPa7zgFPQoAAWhNdo6dWPQH3U?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[No title]]></title><description><![CDATA[XOR linked list. #datastructures]]></description><link>http://direct.ecency.com/hive-193084/@serpent7776/q8l05hgh7g9xx4oagqwfqw</link><guid isPermaLink="true">http://direct.ecency.com/hive-193084/@serpent7776/q8l05hgh7g9xx4oagqwfqw</guid><category><![CDATA[hive-193084]]></category><dc:creator><![CDATA[serpent7776]]></dc:creator><pubDate>Sat, 28 Sep 2024 13:15:27 GMT</pubDate><enclosure url="https://images.ecency.com/p/3auKdN6FdQE2ngPVP1SUxtRWyk459P4MgMHvfDdYBu4usSRzhzgcTcJNGKVC6S?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Master JavaScript with these 5 Exceptional GitHub Repositories]]></title><description><![CDATA[Master JavaScript with these 5 Exceptional GitHub Repositories Welcome, JavaScript enthusiasts! Whether you're just embarking on your coding journey or you're a seasoned developer looking to sharpen your]]></description><link>http://direct.ecency.com/hive-169321/@ricardo21/master-javascript-with-these-5-exceptional-github-repositories</link><guid isPermaLink="true">http://direct.ecency.com/hive-169321/@ricardo21/master-javascript-with-these-5-exceptional-github-repositories</guid><category><![CDATA[hive-169321]]></category><dc:creator><![CDATA[ricardo21]]></dc:creator><pubDate>Mon, 18 Mar 2024 10:18:57 GMT</pubDate><enclosure url="https://images.ecency.com/p/AmRc67RgYaWTamZtjiRVK9pxDgRdg2RtnXmG5dbeGuzK3WNfkBktwpfhcrEWtWUeNagM61va78TSo8eouWskHNqzqFt1RHzsBMhHCDChAhoXCm8eN1aMzGKrmMjCBQb4oXRV6RcFQGf257RFnNRWQmK1kd4x5G4n?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Into the Rabbit Hole of Data Structures]]></title><description><![CDATA[This is my last post about Data Structures, I swear. Besides, there's not much more I could post about this topic since I already went down the rabbit hole with this one, so no more DS from me. I gotta]]></description><link>http://direct.ecency.com/hive-169321/@anomadsoul/into-the-rabbit-hole-with</link><guid isPermaLink="true">http://direct.ecency.com/hive-169321/@anomadsoul/into-the-rabbit-hole-with</guid><category><![CDATA[hive-169321]]></category><dc:creator><![CDATA[anomadsoul]]></dc:creator><pubDate>Sat, 06 Nov 2021 01:42:24 GMT</pubDate><enclosure url="https://images.ecency.com/p/2gsjgna1uruvGBHDnRaj2z6FsL6XEQR3pnqa26GnVnNiJuC92HuwVJuGDTiQgE9Qz4o5iw3io5qBaKZ8dHNoDaLRt2gK2VFuMGAeSdJTQTKmjHgJS2?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[An even Deeper Dive into Data Structures]]></title><description><![CDATA[Rest Pattern and Rest Parameters The rest pattern looks the same as the spread operator (...) but it does the opposite. The spread operator builds new arrays or passes multiple values to an existing function,]]></description><link>http://direct.ecency.com/hive-169321/@anomadsoul/an-even-deeper-dive-into</link><guid isPermaLink="true">http://direct.ecency.com/hive-169321/@anomadsoul/an-even-deeper-dive-into</guid><category><![CDATA[hive-169321]]></category><dc:creator><![CDATA[anomadsoul]]></dc:creator><pubDate>Tue, 02 Nov 2021 13:37:45 GMT</pubDate><enclosure url="https://images.ecency.com/p/PB8ro82ZpZP35bVGjGoE93K3E4U5KX8KtMBJ2rgG3MjCwhnFANxAgZRpUbRtpJTsqvAzekFVWN6qu2Lvx7ssmxU8jNfFtkUv5S1vBYTtzmp9azNS?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[A Deep Dive into Data Structures in JavaScript]]></title><description><![CDATA[Data structures are the basis of JavaScript, without them we couldn't really manipulate everything, and despite variables being the most basic feature, data structures use these variables to actually achieve]]></description><link>http://direct.ecency.com/hive-169321/@anomadsoul/a-deep-dive-into-data</link><guid isPermaLink="true">http://direct.ecency.com/hive-169321/@anomadsoul/a-deep-dive-into-data</guid><category><![CDATA[hive-169321]]></category><dc:creator><![CDATA[anomadsoul]]></dc:creator><pubDate>Mon, 25 Oct 2021 21:35:54 GMT</pubDate><enclosure url="https://images.ecency.com/p/PB8ro82ZpZP35bVGjGoE93K3E4U5KX8KtMBJ2rgG3MjCwhnFANxAgZRpUbRtpJTsqvAzekFVWN6qu2Lvx7ssmxU8jNfFtkUv5S1vBYTtzmp9azNS?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[A Shallow Dive into Data Structures in JavaScript]]></title><description><![CDATA[The Deep Dive will come later guys, don't get ambitious ,first we have to learn about Data Structures before we can jump into the good stuff, the part where we actually learn how to truly have fun with]]></description><link>http://direct.ecency.com/hive-169321/@anomadsoul/a-shallow-dive-into-data</link><guid isPermaLink="true">http://direct.ecency.com/hive-169321/@anomadsoul/a-shallow-dive-into-data</guid><category><![CDATA[hive-169321]]></category><dc:creator><![CDATA[anomadsoul]]></dc:creator><pubDate>Sat, 16 Oct 2021 00:52:12 GMT</pubDate><enclosure url="https://images.ecency.com/p/2gsjgna1uruvGBHDnRaj2z6FsL6XEQR3pnqa26GnUyxdwftAnr4yzd3msJfVzPDbWRwN1NkXqr77oewHkyw4pCGyT8gWbzm8t3eM8Az26Ki7reDBUJ?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[https://ferd.ca/interval-tree-clocks.html Posted via D.Buzz]]></title><link>http://direct.ecency.com/hive-193084/@podewils/k09o7mtwe2oevnze5pz6oa</link><guid isPermaLink="true">http://direct.ecency.com/hive-193084/@podewils/k09o7mtwe2oevnze5pz6oa</guid><category><![CDATA[hive-193084]]></category><dc:creator><![CDATA[podewils]]></dc:creator><pubDate>Sun, 06 Dec 2020 10:30:54 GMT</pubDate></item><item><title><![CDATA[How to be a Successful Blockchain Developer?]]></title><description><![CDATA[Blockchain, being the revolutionary technology that it is, has attracted lots of attention because of its disruptive potential and also opened up a new field of development called blockchain development.]]></description><link>http://direct.ecency.com/blockchain/@ionchain-en/how-to-be-a-successful-blockchain-developer</link><guid isPermaLink="true">http://direct.ecency.com/blockchain/@ionchain-en/how-to-be-a-successful-blockchain-developer</guid><category><![CDATA[blockchain]]></category><dc:creator><![CDATA[ionchain-en]]></dc:creator><pubDate>Fri, 27 Dec 2019 09:28:33 GMT</pubDate><enclosure url="https://images.ecency.com/p/6VvuHGsoU2QBt9MXeXNdDuyd4Bmd63j7zJymDTWgdcJjnzfGQsQtR4gCcZfm69mb75N12xkdDtJFmoHqAhbizdtFgqsLMe8jvUdcJSX3Qw1vXE3NbyqY6M3bHypWm4?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Everything is connected - or why I'm focusing on Relational Applications]]></title><description><![CDATA[Everything is connected with everything else one way or another. You don't have to be a fan of conspiracy theories, to be a believer in some specific religion, to be exceptionally intelligent or have some]]></description><link>http://direct.ecency.com/datastructures/@tomavelev/everything-is-connected-or-why-i-m-focusing-on-relational-applications</link><guid isPermaLink="true">http://direct.ecency.com/datastructures/@tomavelev/everything-is-connected-or-why-i-m-focusing-on-relational-applications</guid><category><![CDATA[datastructures]]></category><dc:creator><![CDATA[tomavelev]]></dc:creator><pubDate>Thu, 31 Jan 2019 13:20:18 GMT</pubDate><enclosure url="https://images.ecency.com/p/21PRtjKRXPQybj4WUXScWv5QPLninWRxfbcWNsx7SenD7FoeDJvgCPKyFz28qkk4Re5pQixaZvAyQRwAsYTDAaBbXjb4RxtVecBkYQkNqPRf5WnGRaVopMLkjT674vLqYfTsxEdJnnY1ydMX8be3dti?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>