<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Hash Map on Rik Kisnah - Blog</title><link>https://www.rik-kisnah.ai/tags/hash-map/</link><description>Recent content in Hash Map on Rik Kisnah - Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 13 Oct 2020 09:00:00 -0700</lastBuildDate><atom:link href="https://www.rik-kisnah.ai/tags/hash-map/feed.xml" rel="self" type="application/rss+xml"/><item><title>Clone a Graph</title><link>https://www.rik-kisnah.ai/teach/coding/clone-graph/</link><pubDate>Tue, 13 Oct 2020 09:00:00 -0700</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/clone-graph/</guid><description>Make an exact copy of a graph where nodes point at each other, possibly in loops. The only new idea over a tree is a map from old node to new node, so you never copy anyone twice and never get stuck going round in circles.</description></item><item><title>Two Sum</title><link>https://www.rik-kisnah.ai/teach/coding/two-sum/</link><pubDate>Tue, 14 Jun 2016 09:00:00 -0700</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/two-sum/</guid><description>Find two numbers in a list that add up to a target. Unsorted list: remember what you have seen in a hash map. Sorted list: one finger at each end, walk them towards each other. Two tricks, one problem, and half of the array questions you will ever be asked.</description></item></channel></rss>