<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Dynamic Programming on Rik Kisnah - Blog</title><link>https://www.rik-kisnah.ai/tags/dynamic-programming/</link><description>Recent content in Dynamic Programming on Rik Kisnah - Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 08 Mar 2022 09:00:00 -0800</lastBuildDate><atom:link href="https://www.rik-kisnah.ai/tags/dynamic-programming/feed.xml" rel="self" type="application/rss+xml"/><item><title>Unique Paths</title><link>https://www.rik-kisnah.ai/teach/coding/unique-paths/</link><pubDate>Tue, 08 Mar 2022 09:00:00 -0800</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/unique-paths/</guid><description>A robot in the top-left corner of a grid can only move right or down. How many ways to reach the bottom-right? Every cell is the sum of the cell above and the cell to its left. Fill the grid once.</description></item><item><title>House Robber</title><link>https://www.rik-kisnah.ai/teach/coding/house-robber/</link><pubDate>Tue, 24 Aug 2021 09:00:00 -0700</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/house-robber/</guid><description>A street of houses with money inside. Rob any you like, but never two next to each other. At each house you choose: take it and skip the last one, or skip it and keep what you had. Two numbers, one walk down the street.</description></item><item><title>Climbing Stairs</title><link>https://www.rik-kisnah.ai/teach/coding/climbing-stairs/</link><pubDate>Tue, 16 Feb 2021 09:00:00 -0800</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/climbing-stairs/</guid><description>You can take one step or two. How many ways to reach the top? The answer is Fibonacci, but the lesson is how to see that the answer to a big question is built from the answers to two smaller ones.</description></item></channel></rss>