<?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, 26 Apr 2026 01:26:02 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/dsa/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[U.S. sanctioned European "censorship figures" including the architect of the Digital Services Act (DSA)]]></title><description><![CDATA[Die USA haben jetzt den ehemaligen EU-Kommissar Thierry Breton, den Architekten des DSA, und weitere Personen von NGOs sanktioniert und ihnen die Einreise in die USA gesperrt, weil diese die Zensur im]]></description><link>http://direct.ecency.com/hive-121566/@vikisecrets/us-sanctioned-european-censorship-figures-including-the-architect-of-the-digital-services-act-dsa</link><guid isPermaLink="true">http://direct.ecency.com/hive-121566/@vikisecrets/us-sanctioned-european-censorship-figures-including-the-architect-of-the-digital-services-act-dsa</guid><category><![CDATA[hive-121566]]></category><dc:creator><![CDATA[vikisecrets]]></dc:creator><pubDate>Mon, 29 Dec 2025 11:58:12 GMT</pubDate><enclosure url="https://images.ecency.com/p/NTy4GV6ooFRmaCXZ8UYgPhoud1kjiNX8QokLEZtbBKLuLWQ9yt7K3o4XiwVQYc85wQgScYKKUCWzUbq6kCgYYfUVaHGHJe6VopckeyMJZwPrPzpBEfAUZjNh9K2VCvWrHdkiUzVBnW7QKDhG95ZrgwXjkHsvzK8JfVwaDMki?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[EU vs X Round 2: US Trade Representative threatens EU companies, EU regulation specifically targeting US BigTech.]]></title><description><![CDATA[Der Streit wegen der 120 Millionen Euro Strafe gegen X geht in die nächste Runde. X wurde wegen drei Verstößen gegen den DSA verurteilt, aber offiziell nicht wegen dem Nicht-Nachkommen von Zensuranfragen]]></description><link>http://direct.ecency.com/hive-121566/@vikisecrets/eu-vs-x-round-2-us-trade-representative-threatens-eu-companies-eu-regulation-specifically-targeting-us-bigtech</link><guid isPermaLink="true">http://direct.ecency.com/hive-121566/@vikisecrets/eu-vs-x-round-2-us-trade-representative-threatens-eu-companies-eu-regulation-specifically-targeting-us-bigtech</guid><category><![CDATA[hive-121566]]></category><dc:creator><![CDATA[vikisecrets]]></dc:creator><pubDate>Thu, 18 Dec 2025 10:07:51 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VvGuVtThSZM8vtoHyCJnGBLYgtyjCUacFVPCwaQg7H9i2FnaqwkSLCmSutw4Z29GTzYHvuZKMX26pWjrG7e9u7PRBDbNeWYBbA61ErmVgRPAN?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[EU vs X. This is brutal. Officially, the EU commission fined X €120m because of "deceptive" blue ticks, not lack of censorship. These are the 3 reasons X was fined.]]></title><description><![CDATA[EU vs X und Elon Musk. Das ist brutal. Offiziell, hat die EU-Kommission eine 120 Millionen Euro-Strafe gegen X (und Elon Musk persönlich) verhängt, nicht wegen zu wenig Zensur, sondern offiziell wegen]]></description><link>http://direct.ecency.com/hive-121566/@vikisecrets/eu-vs-x-this-is-brutal-officially-the-eu-commission-fined-x-euro120m-because-of-deceptive-blue-ticks-not-lack-of-censorship</link><guid isPermaLink="true">http://direct.ecency.com/hive-121566/@vikisecrets/eu-vs-x-this-is-brutal-officially-the-eu-commission-fined-x-euro120m-because-of-deceptive-blue-ticks-not-lack-of-censorship</guid><category><![CDATA[hive-121566]]></category><dc:creator><![CDATA[vikisecrets]]></dc:creator><pubDate>Mon, 08 Dec 2025 10:44:39 GMT</pubDate><enclosure url="https://images.ecency.com/p/NTy4GV6ooFRmaCXZ8UYgPhoud1kjiNX8QokLEZtbBKLuLWQ9yt7K3o4XiwVQYc85wQgScYKKUENqob6Mgmg36PN2juUdjkecTkdfQVs18uQ5QdpwXRzoiodhGynjuePzquGieSt9XV9zagA3eeQw3JKNFqw7s38AwGegL7QJ?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Istuin kahvilassa Tampereella ]]></title><description><![CDATA[Istuin kahvilassa Tampereella ja kuulin, kun viereisessä pöydässä joku puhui kryptokaupasta. Hän mainitsi The Mega Money Wheel Trading ja päätin katsoa, mistä oli kyse. Positiivinen yllätys oli, että pystyin]]></description><link>http://direct.ecency.com/dsa/@gawdasdaw/istuin-kahvilassa-tampereella</link><guid isPermaLink="true">http://direct.ecency.com/dsa/@gawdasdaw/istuin-kahvilassa-tampereella</guid><category><![CDATA[dsa]]></category><dc:creator><![CDATA[gawdasdaw]]></dc:creator><pubDate>Thu, 25 Sep 2025 20:38:24 GMT</pubDate></item><item><title><![CDATA[Wpadłem na reklamę]]></title><description><![CDATA[Wpadłem na reklamę tej strony podczas przeglądania Facebooka i z ciekawości kliknąłem. Od razu zauważyłem przejrzysty układ i spory wybór gier – w Polsce często trudno trafić na platformę, gdzie wszystko]]></description><link>http://direct.ecency.com/dsa/@gawdasdaw/wpadlem-na-reklame</link><guid isPermaLink="true">http://direct.ecency.com/dsa/@gawdasdaw/wpadlem-na-reklame</guid><category><![CDATA[dsa]]></category><dc:creator><![CDATA[gawdasdaw]]></dc:creator><pubDate>Wed, 20 Aug 2025 18:36:18 GMT</pubDate></item><item><title><![CDATA[EU warns Shein with fines for misleading practices like fake discounts, price ...]]></title><description><![CDATA[... manipulation, and greenwashing! Belgium, France, and others are cracking down for better consumer protection. ⚠️🛑 #Shein #EU #ConsumerRights #DSA]]></description><link>http://direct.ecency.com/hive-193084/@cryptoguy/ifmak2mpz2zcte74ggexmy</link><guid isPermaLink="true">http://direct.ecency.com/hive-193084/@cryptoguy/ifmak2mpz2zcte74ggexmy</guid><category><![CDATA[hive-193084]]></category><dc:creator><![CDATA[cryptoguy]]></dc:creator><pubDate>Tue, 27 May 2025 10:09:51 GMT</pubDate></item><item><title><![CDATA[DSA (Medium) - Graph - Keys and Rooms (Python, Typescript & Go)]]></title><description><![CDATA[There are n rooms labeled from 0 to n - 1 and all the rooms are locked except for room 0. Your goal is to visit all the rooms. However, you cannot enter a locked room without having its key. When you visit]]></description><link>http://direct.ecency.com/algorithms/@simplestack/dsa-medium-graph-keys-and-rooms-python-typescript-and-go</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/dsa-medium-graph-keys-and-rooms-python-typescript-and-go</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Tue, 08 Apr 2025 15:07:00 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRTQqz9tkKZT9E1ZngHd8GC6TkLcufpd6Nw4H2ukbHQfRL3ZXZ2VeHjwCut64Whe3NDbbCvWuDEnGAgcJUv2eAx2D8BQ?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Medium) - Binary Search Tree - Delete Node in a BST (Python, Typescript & Go)]]></title><description><![CDATA[Given a root node reference of a BST and a key, delete the node with the given key in the BST. Return the root node reference (possibly updated) of the BST. Basically, the deletion can be divided into]]></description><link>http://direct.ecency.com/algorithms/@simplestack/dsa-medium-binary-search-tree-delete-node-in-a-bst-python-typescript-and-go</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/dsa-medium-binary-search-tree-delete-node-in-a-bst-python-typescript-and-go</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Fri, 04 Apr 2025 14:58:24 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRU8KXZiWSgA7KzZmV9Ldkz8tAzaVWSFwyhRn6jk8HXxjmxqzaA1wQMR5UVUTFFFfAs9C6R2cQg6DqL9s3otQ15jMxz2?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Easy) - Binary Search Tree - Search in a Binary Search Tree (Python, Typescript & Go)]]></title><description><![CDATA[You are given the root of a binary search tree (BST) and an integer val. Find the node in the BST that the node's value equals val and return the subtree rooted with that node. If such a node does not]]></description><link>http://direct.ecency.com/algorithms/@simplestack/dsa-easy-binary-search-tree-search-in-a-binary-search-tree</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/dsa-easy-binary-search-tree-search-in-a-binary-search-tree</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Thu, 03 Apr 2025 14:13:12 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRTqYCXnGAvBxjUWa689oLEJ3oN5rHRK73EppVLoQMohRAFsZKZBHuM9CazXtE9pXStwQuj6LpgSoL4u99FGySkhCkmC?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Medium) - Binary Tree - Maximum Level Sum of a Binary Tree (Python, Typescript & Go)]]></title><description><![CDATA[Given the root of a binary tree, the level of its root is 1, the level of its children is 2, and so on. Return the smallest level x such that the sum of all the values of nodes at level x is maximal. Example]]></description><link>http://direct.ecency.com/algorithms/@simplestack/dsa-medium-binary-tree-maximum-level-sum-of-a-binary-tree-python-typescript-and-go</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/dsa-medium-binary-tree-maximum-level-sum-of-a-binary-tree-python-typescript-and-go</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Wed, 02 Apr 2025 15:15:06 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRTRdRwPzG7M2ZDLjRxBf4azYrmFXM65rZH7r7fHsxiKP3NthgkQJturZCXxnz9fUJ36LeP9jU3u2DSJAVezgjr8B8pe?format=match&amp;mode=fit" length="0" type="false"/></item><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 - Binary Tree Right Side View (Typescript, Python & Rust)]]></title><description><![CDATA[Given the root of a binary tree, imagine yourself standing on the right side of it, return the values of the nodes you can see ordered from top to bottom. Example 1: Input: root = [1,2,3,null,5,null,4]]]></description><link>http://direct.ecency.com/algorithms/@simplestack/dsa-medium-binary-tree-binary-tree-right-side-view</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/dsa-medium-binary-tree-binary-tree-right-side-view</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Tue, 01 Apr 2025 16:28:48 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRTpeo1E8cY31muCD19qsJ6pjoeUQqN5Qf7sQKS1ybzhiRwJnsMyuesYgLcpCVnMoiFWsz1yAdgmZvwinYExs6uhkjj4?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[F*ck Leetcode! Why Roy’s Story Matters]]></title><description><![CDATA[Today, let’s dive into something that’s been buzzing around the tech world: the case of Roy and why it’s a wake-up call for our industry. This 21-year-old has inadvertently pulled back the curtain on just]]></description><link>http://direct.ecency.com/leetcode/@simplestack/fck-leetcode-why-roys-story-matters</link><guid isPermaLink="true">http://direct.ecency.com/leetcode/@simplestack/fck-leetcode-why-roys-story-matters</guid><category><![CDATA[leetcode]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Fri, 28 Mar 2025 20:21:00 GMT</pubDate><enclosure url="https://images.ecency.com/p/8DAuGnTQCLptZgjHUrRAJGcW4y1D4A5QVJJ7zjzqqKdfVHSS6NapSCCBeZkxEv9MKE2xvUXNqEkFZP2qd77AcRgTCJc93FftQYb8ajn4QQGaiR6sc9ZUr5McHUbEQKaYeeHq6aRxtCNWHWACG4ymbs9FZTSP6ykq7xfdpUoKubL?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Medium) — Linked List — Maximum Twin Sum of a Linked List (Python, Typescript & Go)]]></title><description><![CDATA[In a linked list of size n, where n is even, the ith node (0-indexed) of the linked list is known as the twin of the (n-1-i)th node, if 0 <= i <= (n / 2) - 1. For example, if n = 4, then node 0 is]]></description><link>http://direct.ecency.com/algorithms/@simplestack/dsa-medium-linked-list-maximum-twin-sum-of-a-linked-list-python-typescript-and-go</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/dsa-medium-linked-list-maximum-twin-sum-of-a-linked-list-python-typescript-and-go</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Fri, 28 Mar 2025 15:56:42 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRU7hUrZjkT2nQ6YMxks9rKfv1APa4vQxMYdGGKqxwx6dWSmRUy21D12GBMKvVo4UTxo9uQq7wfVs5GQvB2CTRZuaWqC?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Medium) — Binary Tree — Count Good Nodes in Binary Tree (Python, Typescript & Rust)]]></title><description><![CDATA[Source: Leetcode.com Given a binary tree root, a node X in the tree is named good if in the path from root to X there are no nodes with a value greater than X. Return the number of good nodes in the binary]]></description><link>http://direct.ecency.com/algorithms/@simplestack/dsa-medium-binary-tree-count-good-nodes-in-binary-tree-python-typescript-and-rust</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/dsa-medium-binary-tree-count-good-nodes-in-binary-tree-python-typescript-and-rust</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Fri, 28 Mar 2025 14:28:36 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRTRpKvG1k9xMKpgAzmjmsbBPVDEW6Erogozm5PTKYcAK5LMQeLKz3kdvpuhf4EqvRraQvjQYa2AAjCMa14nkfKx55j4?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[DSA (Medium) —Linked List — Odd Even Linked List (Python, Typescript & Go)]]></title><description><![CDATA[Given the head of a singly linked list, group all the nodes with odd indices together followed by the nodes with even indices, and return the reordered list. The first node is considered odd, and the second]]></description><link>http://direct.ecency.com/algorithms/@simplestack/dsa-medium-linked-list-odd-even-linked-list-python-typescript-and-go</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/dsa-medium-linked-list-odd-even-linked-list-python-typescript-and-go</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Fri, 28 Mar 2025 01:50:15 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRTmPygH519sLiWrxwGtbAcZqWGgwkGpRYkhEg7NB39h8kbayPMuRKHjZvSAjNoCzMd18vw9GEg4hTDG8LqUBDKQQ3Sn?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[How To Reverse Words in a String (Python, Typescript and Go)]]></title><description><![CDATA[Write a function that takes a string as input and returns a new string with the words in reverse order. Words are sequences of non-space characters and are separated by one or more spaces in the input]]></description><link>http://direct.ecency.com/algorithms/@simplestack/how-to-reverse-words-in-a-string-python-typescript-and-go</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/how-to-reverse-words-in-a-string-python-typescript-and-go</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Fri, 28 Mar 2025 01:31:36 GMT</pubDate><enclosure url="https://images.ecency.com/p/8DAuGnTQCLptZgjHUrRAJGcW4y1D4A5QVJJ7zjzqqKdfVHSS6NapSCCBeZkxEv9MKE2xvUXNqEjr3rJBBPCBbqAqiPX9unZ6wZoTzuws74GRC5iZW4vGEYNfhzASP2VUtnpiTzPAp3xDZgiQfiJoSmcT7De2Xn6K7XzhUcb4RkJ?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[How To Know If Two Vectors Are Colinear? (Python)]]></title><description><![CDATA[“Collinearity of vectors is the silent language of geometry, where lines speak in unison and points align with purpose.” — Unknown In the exciting world of linear algebra, vectors play a starring role.]]></description><link>http://direct.ecency.com/algorithms/@simplestack/how-to-know-if-two-vectors-are-colinear-python</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/how-to-know-if-two-vectors-are-colinear-python</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Fri, 28 Mar 2025 01:25:09 GMT</pubDate><enclosure url="https://images.ecency.com/p/4HFqJv9qRjVecs4xkhd5EvhidWEEBnn9tCVDBkBhQpUFvab78MhbU1VuqzQhNG32WehwWGcNRTRGR6342Lu6WznHh8SbwXa2LVbZkCdDN1xSoesRrawDSmx9ArnRKQAFHnjpijwz6zfACeHbBUZmz69caCzrNv9Sini?format=match&amp;mode=fit" length="0" type="false"/></item><item><title><![CDATA[Interviewer: Kids With the Greatest Number of Candies (Typescript, Python, Go)]]></title><description><![CDATA[You have n children, each with a certain number of candies. The number of candies each child has is given in the integer array candies, where candies[i] is the number of candies the i-th child has. You]]></description><link>http://direct.ecency.com/algorithms/@simplestack/interviewer-kids-with-the-greatest-number-of-candies-typescript-python-go</link><guid isPermaLink="true">http://direct.ecency.com/algorithms/@simplestack/interviewer-kids-with-the-greatest-number-of-candies-typescript-python-go</guid><category><![CDATA[algorithms]]></category><dc:creator><![CDATA[simplestack]]></dc:creator><pubDate>Fri, 28 Mar 2025 01:18:03 GMT</pubDate><enclosure url="https://images.ecency.com/p/8DAuGnTQCLptZgjHUrRAJGcW4y1D4A5QVJJ7zjzqqKdfVHSS6NapSCCBeZkxEv9MKE2xvUXNqEk2n5p1jUC27ieZMB4UyiXinuVrzq4KjszLvVz7YJSFbNPrknijrNNLzZFSjqukvVsNSSzhPL8cvPTZMBk64baLdLCs2DkgaYv?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>