<?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 Sashi on Medium]]></title>
        <description><![CDATA[Stories by Sashi on Medium]]></description>
        <link>https://medium.com/@sashikanth.bits?source=rss-267f5d49a3b0------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*DhrTDKBbnY0BnB9F.jpg</url>
            <title>Stories by Sashi on Medium</title>
            <link>https://medium.com/@sashikanth.bits?source=rss-267f5d49a3b0------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Sun, 22 Nov 2026 07:13:32 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@sashikanth.bits/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[Dynamic programming with b]]></title>
            <link>https://medium.com/@sashikanth.bits/dynamic-programming-with-b-433fac6cfde9?source=rss-267f5d49a3b0------2</link>
            <guid isPermaLink="false">https://medium.com/p/433fac6cfde9</guid>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[bitmask]]></category>
            <category><![CDATA[dynamic-programming]]></category>
            <dc:creator><![CDATA[Sashi]]></dc:creator>
            <pubDate>Tue, 08 Aug 2023 18:30:30 GMT</pubDate>
            <atom:updated>2023-08-08T18:30:52.913Z</atom:updated>
            <content:encoded><![CDATA[<h3>Dynamic programming with bit masks</h3><p>resource by Gaurav: <a href="https://www.youtube.com/watch?v=bjucBkxrMBs&amp;t=0s">https://www.youtube.com/watch?v=bjucBkxrMBs&amp;t=0s</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=433fac6cfde9" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Trie intervie]]></title>
            <link>https://medium.com/@sashikanth.bits/trie-intervie-370ff3d9574f?source=rss-267f5d49a3b0------2</link>
            <guid isPermaLink="false">https://medium.com/p/370ff3d9574f</guid>
            <category><![CDATA[data-structure-algorithm]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[interview-questions]]></category>
            <category><![CDATA[trie]]></category>
            <dc:creator><![CDATA[Sashi]]></dc:creator>
            <pubDate>Tue, 08 Aug 2023 18:26:59 GMT</pubDate>
            <atom:updated>2023-08-08T18:26:59.262Z</atom:updated>
            <content:encoded><![CDATA[<h3>Trie interview questions</h3><p>resource: <a href="https://www.techiedelight.com/trie-interview-questions/">https://www.techiedelight.com/trie-interview-questions/</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=370ff3d9574f" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Linked List]]></title>
            <link>https://medium.com/@sashikanth.bits/linked-list-48a377752d82?source=rss-267f5d49a3b0------2</link>
            <guid isPermaLink="false">https://medium.com/p/48a377752d82</guid>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[linked-lists]]></category>
            <dc:creator><![CDATA[Sashi]]></dc:creator>
            <pubDate>Tue, 08 Aug 2023 18:17:17 GMT</pubDate>
            <atom:updated>2023-08-08T18:17:17.538Z</atom:updated>
            <content:encoded><![CDATA[<p>A Linked List is a<strong> linear data structure</strong> that looks like a chain of nodes, where each node is a different element. Unlike Arrays, Linked List elements are not stored at a contiguous location.</p><p>Here is the collection of the Top 50 list of frequently asked interviews question on Linked Lists. Problems in this Article are divided into three Levels so that readers can practice according to the difficulty level step by step.</p><p><strong>Easy Level Problems on Linked List Data Structure</strong></p><p><a href="https://www.geeksforgeeks.org/write-a-c-function-to-print-the-middle-of-the-linked-list/">Print the Middle of a given linked list</a></p><p><a href="https://www.geeksforgeeks.org/reverse-a-linked-list/">Reverse a Linked List</a></p><p><a href="https://www.geeksforgeeks.org/reverse-a-doubly-linked-list/">Reverse a Doubly Linked List</a></p><p><a href="https://www.geeksforgeeks.org/rotate-a-linked-list/">Rotate a linked list.</a></p><p><a href="https://www.geeksforgeeks.org/nth-node-from-the-end-of-a-linked-list/">Nth node from end of linked list</a></p><p><a href="https://www.geeksforgeeks.org/delete-last-occurrence-of-an-item-from-linked-list/">Delete last occurrence of an item from linked list</a></p><p><a href="https://www.geeksforgeeks.org/delete-middle-of-linked-list/">Delete middle of linked list</a></p><p><a href="https://practice.geeksforgeeks.org/problems/remove-duplicate-element-from-sorted-linked-list/1">Remove duplicate elements from sorted linked list</a></p><p><a href="https://www.geeksforgeeks.org/detect-loop-in-a-linked-list/">Detect Loop in linked list</a></p><p><a href="https://www.geeksforgeeks.org/delete-n-nodes-after-m-nodes-of-a-linked-list/">Delete N nodes after M nodes of a linked list</a></p><p><a href="https://www.geeksforgeeks.org/merge-a-linked-list-into-another-linked-list-at-alternate-positions/">Merge a linked list into another linked list at alternate positions</a></p><p><a href="https://www.geeksforgeeks.org/traversal-of-circular-linked-list/">Circular Linked List Traversal</a></p><p><a href="https://www.geeksforgeeks.org/deletion-circular-linked-list/">Deletion from a Circular Linked List</a></p><p><a href="https://www.geeksforgeeks.org/delete-a-node-from-linked-list-without-head-pointer/">Delete without head pointer</a></p><p><a href="https://www.geeksforgeeks.org/queue-linked-list-implementation/">Implement Queue using Linked List</a></p><p><a href="https://www.geeksforgeeks.org/implement-a-stack-using-singly-linked-list/">Implement a stack using singly linked list</a></p><p><a href="https://www.geeksforgeeks.org/remove-every-k-th-node-linked-list/">Remove every k-th node of the linked list</a></p><p><a href="https://www.geeksforgeeks.org/pairwise-swap-elements-of-a-given-linked-list/">Pairwise swap of a Linked list</a></p><p><a href="https://www.geeksforgeeks.org/write-a-function-that-counts-the-number-of-times-a-given-int-occurs-in-a-linked-list/">Occurence of an integer in a Linked List</a></p><p><a href="https://www.geeksforgeeks.org/sort-a-linked-list-of-0s-1s-or-2s/">Given a Linked list of 0s, 1s and 2s, sort it</a></p><p><a href="https://www.geeksforgeeks.org/deletion-in-linked-list/">Deletion in Linked List</a></p><p><strong>Medium Level Problems on Linked List Data Structure</strong></p><p><a href="https://www.geeksforgeeks.org/convert-singly-linked-list-circular-linked-list/">Convert singly linked list into circular linked list</a></p><p><a href="https://practice.geeksforgeeks.org/problems/reverse-a-linked-list-in-groups-of-given-size/1">Reverse a linked list in groups of given size</a></p><p><a href="https://www.geeksforgeeks.org/merge-two-sorted-linked-lists/">Merge two sorted linked lists</a></p><p><a href="https://www.geeksforgeeks.org/detect-and-remove-loop-in-a-linked-list/">Remove loop in Linked List</a></p><p><a href="https://www.geeksforgeeks.org/function-to-check-if-a-singly-linked-list-is-palindrome/">Function to check if a singly linked list is palindrome</a></p><p><a href="https://www.geeksforgeeks.org/delete-occurrences-given-key-linked-list/">Remove all occurrences of one Linked list in another Linked list</a></p><p><a href="https://www.geeksforgeeks.org/write-a-function-to-get-the-intersection-point-of-two-linked-lists/">Intersection point in Y shaped Linked lists</a></p><p><a href="https://www.geeksforgeeks.org/intersection-of-two-sorted-linked-lists/">Intersection of two Sorted Linked Lists</a></p><p><a href="https://www.geeksforgeeks.org/split-a-circular-linked-list-into-two-halves/">Split a Circular Linked List into two halves</a></p><p><a href="https://www.geeksforgeeks.org/find-pairs-given-sum-doubly-linked-list/">Find pairs with given sum in doubly linked list</a></p><p><a href="https://www.geeksforgeeks.org/remove-duplicates-unsorted-doubly-linked-list/">Remove duplicates from an unsorted doubly linked list</a></p><p><a href="https://www.geeksforgeeks.org/write-a-function-to-get-the-intersection-point-of-two-linked-lists/">Intersection point of two Linked Lists.</a></p><p><a href="https://www.geeksforgeeks.org/add-two-numbers-represented-by-linked-list/">Add two numbers represented by Linked lists</a></p><p><a href="https://www.geeksforgeeks.org/multiply-two-numbers-represented-linked-lists/">Multiply two numbers represented by Linked Lists</a></p><p><a href="https://www.geeksforgeeks.org/swap-kth-node-from-beginning-with-kth-node-from-end-in-a-linked-list/">Swap Kth node from beginning with Kth node from end in a Linked List</a></p><p><a href="https://www.geeksforgeeks.org/sort-k-sorted-doubly-linked-list/">Sort a k sorted doubly linked list</a></p><p><a href="https://www.geeksforgeeks.org/rotate-doubly-linked-list-n-nodes/">Rotate Doubly linked list by N nodes</a></p><p><a href="https://www.geeksforgeeks.org/convert-a-binary-tree-into-doubly-linked-list-in-spiral-fashion/">Convert a Binary Tree into Doubly Linked List in spiral fashion</a></p><p><a href="https://www.geeksforgeeks.org/convert-binary-tree-to-doubly-linked-list-by-keeping-track-of-visited-node/">Convert a given Binary Tree to Doubly Linked List</a></p><p><a href="https://www.geeksforgeeks.org/construct-linked-list-2d-matrix/">Construct a linked list from 2D matrix</a></p><p><a href="https://www.geeksforgeeks.org/reverse-doubly-linked-list-groups-given-size/">Reverse a doubly linked list in groups of given size</a></p><p><strong>Hard Level Problems on Linked List Data Structure</strong></p><p><a href="https://www.geeksforgeeks.org/reverse-sublist-linked-list/">Reverse a sublist of linked list</a></p><p><a href="https://www.geeksforgeeks.org/rearrange-a-given-linked-list-in-place/">Rearrange a given linked list in-place.</a></p><p><a href="https://www.geeksforgeeks.org/reverse-alternate-k-nodes-in-a-singly-linked-list/">Reverse Alternate K Nodes in a Singly Linked List:</a></p><p><a href="https://www.geeksforgeeks.org/reverse-a-linked-list-in-groups-of-given-size/">Reverse a Linked List in groups of given size</a></p><p><a href="https://www.geeksforgeeks.org/merge-k-sorted-linked-lists/">Merge k Sorted Linked Lists</a></p><p><a href="https://www.geeksforgeeks.org/flattening-a-linked-list/">Flattening a Linked List</a></p><p><a href="https://www.geeksforgeeks.org/partitioning-a-linked-list-around-a-given-value-and-keeping-the-original-order/">Partition a linked list around a given value</a></p><p><a href="https://www.geeksforgeeks.org/a-linked-list-with-next-and-arbit-pointer/">Clone a linked list with random pointers</a></p><p>Resources:</p><p><a href="https://www.geeksforgeeks.org/top-20-linked-list-interview-question/">https://www.geeksforgeeks.org/top-20-linked-list-interview-question/</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=48a377752d82" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>