<?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" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Coding Interview - Medium]]></title>
        <description><![CDATA[Coding challenges, coding interviews and how to prepare for them - Medium]]></description>
        <link>https://medium.com/the-art-of-problem-solving?source=rss----52169c0357a8---4</link>
        <image>
            <url>https://cdn-images-1.medium.com/proxy/1*TGH72Nnw24QL3iV9IOm4VA.png</url>
            <title>Coding Interview - Medium</title>
            <link>https://medium.com/the-art-of-problem-solving?source=rss----52169c0357a8---4</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Mon, 01 Jun 2026 00:31:46 GMT</lastBuildDate>
        <atom:link href="https://medium.com/feed/the-art-of-problem-solving" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com" rel="hub"/>
        <item>
            <title><![CDATA[Simple C++ Solution To Leetcode 725. Split Linked List In Parts]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://medium.com/the-art-of-problem-solving/simple-c-solution-to-leetcode-725-split-linked-list-in-parts-36a1f746a229?source=rss----52169c0357a8---4"><img src="https://cdn-images-1.medium.com/max/1359/1*nSfGP9H3N52OoFraUFzNdA.png" width="1359"></a></p><p class="medium-feed-snippet">Be aware of when you can stop the long process earlier</p><p class="medium-feed-link"><a href="https://medium.com/the-art-of-problem-solving/simple-c-solution-to-leetcode-725-split-linked-list-in-parts-36a1f746a229?source=rss----52169c0357a8---4">Continue reading on Coding Interview »</a></p></div>]]></description>
            <link>https://medium.com/the-art-of-problem-solving/simple-c-solution-to-leetcode-725-split-linked-list-in-parts-36a1f746a229?source=rss----52169c0357a8---4</link>
            <guid isPermaLink="false">https://medium.com/p/36a1f746a229</guid>
            <category><![CDATA[leetcode-solution]]></category>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[cpp]]></category>
            <category><![CDATA[linked-lists]]></category>
            <dc:creator><![CDATA[Nhut Nguyen]]></dc:creator>
            <pubDate>Wed, 29 Sep 2021 21:24:07 GMT</pubDate>
            <atom:updated>2021-09-29T21:24:07.331Z</atom:updated>
        </item>
    </channel>
</rss>