<?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 20:55:07 GMT</lastBuildDate><atom:link href="http://direct.ecency.com/created/hashtable/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[Advantage of BST (BInary Search Tree) over Hash Table]]></title><description><![CDATA[What is binary Search tree? BST is the node-based binary tree data structure. A binary tree is a tree that has almost 2 children. The Binary search tree differs from the Binary tree in the aspect that:-]]></description><link>http://direct.ecency.com/hive-169321/@aco5/advantage-of-bst-binary-search-tree-over-hash-table</link><guid isPermaLink="true">http://direct.ecency.com/hive-169321/@aco5/advantage-of-bst-binary-search-tree-over-hash-table</guid><category><![CDATA[hive-169321]]></category><dc:creator><![CDATA[aco5]]></dc:creator><pubDate>Mon, 10 May 2021 15:20:15 GMT</pubDate></item><item><title><![CDATA[Golang Programming Datastructure----HashTable.]]></title><description><![CDATA[哈希 hash 哈希表基本介绍： 散列表(Hash table，也叫哈希表)，是根据关键码值（Key value)而直接进行访问的数据结构。 也就是说，它通过把关键码值映射到表中给一个位置来访问记录，以加快查找的速度。 这个映射函数叫做散列函数，存放记录的数组叫做散列表； google公司的一个上机题 有一个公司，当有新的员工来报道时，要求将员工的信息加入(id,性别，年龄，住址...),]]></description><link>http://direct.ecency.com/golang/@sslinux/golang-programming-datastructure-hashtable</link><guid isPermaLink="true">http://direct.ecency.com/golang/@sslinux/golang-programming-datastructure-hashtable</guid><category><![CDATA[golang]]></category><dc:creator><![CDATA[sslinux]]></dc:creator><pubDate>Wed, 02 Jan 2019 06:37:18 GMT</pubDate></item><item><title><![CDATA[LeetCode 1. Two Sum: CPP Solution]]></title><description><![CDATA[Problem Statement Given an integer array of size N, return indices of the two numbers such that they add up to a specific target. Function Signature: C++ vector<int> twoSum(vector<int> input,]]></description><link>http://direct.ecency.com/leetcode/@elsyr/leetcode-1-two-sum-cpp-solution</link><guid isPermaLink="true">http://direct.ecency.com/leetcode/@elsyr/leetcode-1-two-sum-cpp-solution</guid><category><![CDATA[leetcode]]></category><dc:creator><![CDATA[elsyr]]></dc:creator><pubDate>Fri, 22 Dec 2017 00:46:39 GMT</pubDate></item><item><title><![CDATA[Software Engineer Interview Tips - Using Hashtable to Reduce Runtime Complexity 软件工程师面试技巧之 使用哈希表降复杂度]]></title><description><![CDATA[I am recently reviewing the data structure & algorithms. And the hash table is one of the key knowledge that you can't miss before you attend a coding interview. The hashtable has O(1) complexity of]]></description><link>http://direct.ecency.com/cn/@justyy/software-engineer-interview-tips-using-hashtable-to-reduce-runtime-complexity</link><guid isPermaLink="true">http://direct.ecency.com/cn/@justyy/software-engineer-interview-tips-using-hashtable-to-reduce-runtime-complexity</guid><category><![CDATA[cn]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Thu, 03 Aug 2017 14:26:48 GMT</pubDate><enclosure url="https://images.ecency.com/p/FxX5caie56yojQJz6b9QcJahQVPZvsPGu9pkSWWWx1pyznMf2ztMo18r7XQxZ3ENRp5SweQrYThcfBwpC8YUDfi7gMEpN5KrLFNqPfHgaQPQ?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>