<?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[Stories by Rohith Vazhathody on Medium]]></title>
        <description><![CDATA[Stories by Rohith Vazhathody on Medium]]></description>
        <link>https://medium.com/@rohithv63?source=rss-c169aa63317a------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*ILKiO5CKEFMukuub</url>
            <title>Stories by Rohith Vazhathody on Medium</title>
            <link>https://medium.com/@rohithv63?source=rss-c169aa63317a------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Fri, 26 Jun 2026 05:02:48 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@rohithv63/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com" rel="hub"/>
        <item>
            <title><![CDATA[Java Solution: Redundant Parenthesis Detection O(N)]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://rohithv63.medium.com/java-solution-redundant-parenthesis-detection-o-n-92e3dd861751?source=rss-c169aa63317a------2"><img src="https://cdn-images-1.medium.com/max/2600/1*QSrVSEnRS6X5wG6ivH2GIQ.png" width="2880"></a></p><p class="medium-feed-snippet">Stack-Based Approach</p><p class="medium-feed-link"><a href="https://rohithv63.medium.com/java-solution-redundant-parenthesis-detection-o-n-92e3dd861751?source=rss-c169aa63317a------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://rohithv63.medium.com/java-solution-redundant-parenthesis-detection-o-n-92e3dd861751?source=rss-c169aa63317a------2</link>
            <guid isPermaLink="false">https://medium.com/p/92e3dd861751</guid>
            <category><![CDATA[coding]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[learning]]></category>
            <category><![CDATA[software-engineering]]></category>
            <dc:creator><![CDATA[Rohith Vazhathody]]></dc:creator>
            <pubDate>Sat, 17 Jan 2026 06:25:20 GMT</pubDate>
            <atom:updated>2026-01-17T06:25:20.806Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Count Subarray with k odds]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://rohithv63.medium.com/count-subarray-with-k-odds-55548886c380?source=rss-c169aa63317a------2"><img src="https://cdn-images-1.medium.com/max/2600/1*gGzcKQIrPvMwRNwXCLjcOQ.png" width="2880"></a></p><p class="medium-feed-snippet">The AtMost trick using Sliding Window</p><p class="medium-feed-link"><a href="https://rohithv63.medium.com/count-subarray-with-k-odds-55548886c380?source=rss-c169aa63317a------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://rohithv63.medium.com/count-subarray-with-k-odds-55548886c380?source=rss-c169aa63317a------2</link>
            <guid isPermaLink="false">https://medium.com/p/55548886c380</guid>
            <category><![CDATA[java]]></category>
            <category><![CDATA[learning]]></category>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[software-engineering]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[Rohith Vazhathody]]></dc:creator>
            <pubDate>Wed, 07 Jan 2026 18:55:30 GMT</pubDate>
            <atom:updated>2026-01-07T18:55:30.882Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Leetcode 1970. Last Day Where You Can Still Cross]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://rohithv63.medium.com/leetcode-1970-last-day-where-you-can-still-cross-9d092b332b9e?source=rss-c169aa63317a------2"><img src="https://cdn-images-1.medium.com/max/2600/1*HK3VFJ83180afquL-oMhPg.png" width="2860"></a></p><p class="medium-feed-snippet">Binary Search + BFS and Optimised DSU Approach</p><p class="medium-feed-link"><a href="https://rohithv63.medium.com/leetcode-1970-last-day-where-you-can-still-cross-9d092b332b9e?source=rss-c169aa63317a------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://rohithv63.medium.com/leetcode-1970-last-day-where-you-can-still-cross-9d092b332b9e?source=rss-c169aa63317a------2</link>
            <guid isPermaLink="false">https://medium.com/p/9d092b332b9e</guid>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[java]]></category>
            <category><![CDATA[software-engineering]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[learning]]></category>
            <dc:creator><![CDATA[Rohith Vazhathody]]></dc:creator>
            <pubDate>Wed, 31 Dec 2025 14:25:05 GMT</pubDate>
            <atom:updated>2025-12-31T14:25:05.873Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Kth Missing Positive Number in a Sorted Array]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://rohithv63.medium.com/kth-missing-positive-number-in-a-sorted-array-7b6047e637f0?source=rss-c169aa63317a------2"><img src="https://cdn-images-1.medium.com/max/2600/1*mLJWH3Vcysk7LLYCMTHLuA.png" width="2878"></a></p><p class="medium-feed-snippet">Binary Search to find the missing number</p><p class="medium-feed-link"><a href="https://rohithv63.medium.com/kth-missing-positive-number-in-a-sorted-array-7b6047e637f0?source=rss-c169aa63317a------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://rohithv63.medium.com/kth-missing-positive-number-in-a-sorted-array-7b6047e637f0?source=rss-c169aa63317a------2</link>
            <guid isPermaLink="false">https://medium.com/p/7b6047e637f0</guid>
            <category><![CDATA[computer-science]]></category>
            <category><![CDATA[geeksforgeeks]]></category>
            <category><![CDATA[learning]]></category>
            <category><![CDATA[java]]></category>
            <category><![CDATA[interview]]></category>
            <dc:creator><![CDATA[Rohith Vazhathody]]></dc:creator>
            <pubDate>Fri, 26 Dec 2025 12:23:22 GMT</pubDate>
            <atom:updated>2025-12-26T12:23:22.151Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Leetcode 3075. Maximize Happiness of Selected Children]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://rohithv63.medium.com/leetcode-3075-maximize-happiness-of-selected-children-ca2c2291567b?source=rss-c169aa63317a------2"><img src="https://cdn-images-1.medium.com/max/2600/1*9SDc-ExHYg5z_bH7CPCBBg.png" width="2852"></a></p><p class="medium-feed-snippet">Greedily select the happy child after decay</p><p class="medium-feed-link"><a href="https://rohithv63.medium.com/leetcode-3075-maximize-happiness-of-selected-children-ca2c2291567b?source=rss-c169aa63317a------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://rohithv63.medium.com/leetcode-3075-maximize-happiness-of-selected-children-ca2c2291567b?source=rss-c169aa63317a------2</link>
            <guid isPermaLink="false">https://medium.com/p/ca2c2291567b</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[learning]]></category>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[java]]></category>
            <dc:creator><![CDATA[Rohith Vazhathody]]></dc:creator>
            <pubDate>Thu, 25 Dec 2025 18:29:55 GMT</pubDate>
            <atom:updated>2025-12-25T18:29:55.798Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Leetcode 3573. Best Time to Buy and Sell Stock V]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://rohithv63.medium.com/leetcode-3573-best-time-to-buy-and-sell-stock-v-381a97fa09c4?source=rss-c169aa63317a------2"><img src="https://cdn-images-1.medium.com/max/2600/1*Xdameg7a0iFdDEQxX1lWOQ.png" width="2866"></a></p><p class="medium-feed-snippet">Recursive way of solving this problem.</p><p class="medium-feed-link"><a href="https://rohithv63.medium.com/leetcode-3573-best-time-to-buy-and-sell-stock-v-381a97fa09c4?source=rss-c169aa63317a------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://rohithv63.medium.com/leetcode-3573-best-time-to-buy-and-sell-stock-v-381a97fa09c4?source=rss-c169aa63317a------2</link>
            <guid isPermaLink="false">https://medium.com/p/381a97fa09c4</guid>
            <category><![CDATA[java]]></category>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[interview]]></category>
            <dc:creator><![CDATA[Rohith Vazhathody]]></dc:creator>
            <pubDate>Wed, 24 Dec 2025 18:59:26 GMT</pubDate>
            <atom:updated>2025-12-24T18:59:26.349Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Count Indices to Balance Even and Odd Sums]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://rohithv63.medium.com/count-indices-to-balance-even-and-odd-sums-88a152f5db60?source=rss-c169aa63317a------2"><img src="https://cdn-images-1.medium.com/max/2600/1*EW-cpmPrNmoL_brwb55flQ.png" width="2880"></a></p><p class="medium-feed-snippet">Prefix Sum technique to handle even and odd sums efficiently</p><p class="medium-feed-link"><a href="https://rohithv63.medium.com/count-indices-to-balance-even-and-odd-sums-88a152f5db60?source=rss-c169aa63317a------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://rohithv63.medium.com/count-indices-to-balance-even-and-odd-sums-88a152f5db60?source=rss-c169aa63317a------2</link>
            <guid isPermaLink="false">https://medium.com/p/88a152f5db60</guid>
            <category><![CDATA[learning]]></category>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[java]]></category>
            <category><![CDATA[programming]]></category>
            <dc:creator><![CDATA[Rohith Vazhathody]]></dc:creator>
            <pubDate>Tue, 16 Dec 2025 18:58:34 GMT</pubDate>
            <atom:updated>2025-12-16T18:58:34.398Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Leetcode 2110. Number of Smooth Descent Periods of a Stock]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://rohithv63.medium.com/leetcode-2110-number-of-smooth-descent-periods-of-a-stock-93a0d86bac3b?source=rss-c169aa63317a------2"><img src="https://cdn-images-1.medium.com/max/2600/1*zMN23vwL5mmYXrOjVYn7rg.png" width="2878"></a></p><p class="medium-feed-snippet">2 Pointer Approach calculating the contiguous days</p><p class="medium-feed-link"><a href="https://rohithv63.medium.com/leetcode-2110-number-of-smooth-descent-periods-of-a-stock-93a0d86bac3b?source=rss-c169aa63317a------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://rohithv63.medium.com/leetcode-2110-number-of-smooth-descent-periods-of-a-stock-93a0d86bac3b?source=rss-c169aa63317a------2</link>
            <guid isPermaLink="false">https://medium.com/p/93a0d86bac3b</guid>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[java]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[coding-interviews]]></category>
            <category><![CDATA[algorithms]]></category>
            <dc:creator><![CDATA[Rohith Vazhathody]]></dc:creator>
            <pubDate>Mon, 15 Dec 2025 13:55:14 GMT</pubDate>
            <atom:updated>2025-12-15T13:56:18.213Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Leetcode 2147. Number of Ways to Divide a Long Corridor]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://rohithv63.medium.com/leetcode-2147-number-of-ways-to-divide-a-long-corridor-52e319576dfb?source=rss-c169aa63317a------2"><img src="https://cdn-images-1.medium.com/max/2600/1*Z_IGSNPRSxDun7QYyqt_wA.png" width="2862"></a></p><p class="medium-feed-snippet">Trace the Seats and count dividers.</p><p class="medium-feed-link"><a href="https://rohithv63.medium.com/leetcode-2147-number-of-ways-to-divide-a-long-corridor-52e319576dfb?source=rss-c169aa63317a------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://rohithv63.medium.com/leetcode-2147-number-of-ways-to-divide-a-long-corridor-52e319576dfb?source=rss-c169aa63317a------2</link>
            <guid isPermaLink="false">https://medium.com/p/52e319576dfb</guid>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[learning]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[interview-preparation]]></category>
            <dc:creator><![CDATA[Rohith Vazhathody]]></dc:creator>
            <pubDate>Sun, 14 Dec 2025 08:46:14 GMT</pubDate>
            <atom:updated>2025-12-14T08:46:14.606Z</atom:updated>
        </item>
        <item>
            <title><![CDATA[Leetcode 3606. Coupon Code Validator]]></title>
            <description><![CDATA[<div class="medium-feed-item"><p class="medium-feed-image"><a href="https://rohithv63.medium.com/leetcode-3606-coupon-code-validator-960360410322?source=rss-c169aa63317a------2"><img src="https://cdn-images-1.medium.com/max/2600/1*RXrOk4xPonA3tIvFatom-w.png" width="2872"></a></p><p class="medium-feed-snippet">Using Custom Sorting</p><p class="medium-feed-link"><a href="https://rohithv63.medium.com/leetcode-3606-coupon-code-validator-960360410322?source=rss-c169aa63317a------2">Continue reading on Medium »</a></p></div>]]></description>
            <link>https://rohithv63.medium.com/leetcode-3606-coupon-code-validator-960360410322?source=rss-c169aa63317a------2</link>
            <guid isPermaLink="false">https://medium.com/p/960360410322</guid>
            <category><![CDATA[computer-science]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[interview]]></category>
            <category><![CDATA[leetcode]]></category>
            <category><![CDATA[learning]]></category>
            <dc:creator><![CDATA[Rohith Vazhathody]]></dc:creator>
            <pubDate>Sat, 13 Dec 2025 09:22:39 GMT</pubDate>
            <atom:updated>2025-12-13T09:22:39.232Z</atom:updated>
        </item>
    </channel>
</rss>