<?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>https://ecency.com</link><image><url>https://ecency.com/logo512.png</url><title>RSS Feed</title><link>https://ecency.com</link></image><generator>RSS for Node</generator><lastBuildDate>Wed, 30 Sep 2026 20:26:05 GMT</lastBuildDate><atom:link href="https://ecency.com/created/math-competition/rss.xml" rel="self" type="application/rss+xml"/><item><title><![CDATA[Software Engineer Interview Question - How Many Ways from A to C via B? 软件工程师面试技巧之 从A到B再到C有多少种方法?]]></title><description><![CDATA[Let’s see this question: If @kenchung starts at A, and he can only travels one move at a time to the north or east, and he cannot go back. If he needs to travel through B, and finally reach C, how many]]></description><link>https://ecency.com/@justyy/software-engineer-interview-question-how-many-ways-from-a-to-c-via-b-a-b-c</link><guid isPermaLink="true">https://ecency.com/@justyy/software-engineer-interview-question-how-many-ways-from-a-to-c-via-b-a-b-c</guid><category><![CDATA[cn]]></category><dc:creator><![CDATA[justyy]]></dc:creator><pubDate>Sun, 06 Aug 2017 22:09:30 GMT</pubDate><enclosure url="https://i.ecency.com/p/3HaJVw3AYyXBEpcZfJ6rUiRsoPNoXsn5Fp6uwoRHiwo6vZVvzJJhfsZNbbdxz67EBofPPD33VL7ggJWKLF3F6Gu1jE6vT37fJweDzF8?format=match&amp;mode=fit" length="0" type="false"/></item></channel></rss>