<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Combinatorics on Rik Kisnah - Blog</title><link>https://www.rik-kisnah.ai/tags/combinatorics/</link><description>Recent content in Combinatorics on Rik Kisnah - Blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 10 Jun 2025 09:00:00 -0700</lastBuildDate><atom:link href="https://www.rik-kisnah.ai/tags/combinatorics/feed.xml" rel="self" type="application/rss+xml"/><item><title>Subsets (Backtracking)</title><link>https://www.rik-kisnah.ai/teach/coding/subsets/</link><pubDate>Tue, 10 Jun 2025 09:00:00 -0700</pubDate><guid>https://www.rik-kisnah.ai/teach/coding/subsets/</guid><description>Every possible group you can make from a set of items, including the empty group. For each item, choose to take it or leave it. That choose-then-undo rhythm is backtracking, and it is behind every &amp;lsquo;all combinations&amp;rsquo; question.</description></item><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></channel></rss>