<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Parag</title>
    <description>The latest articles on DEV Community by Parag (@parag18081994).</description>
    <link>https://dev.to/parag18081994</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F507116%2Fe14c84f1-8c99-445d-a894-c9711fd29be3.png</url>
      <title>DEV Community: Parag</title>
      <link>https://dev.to/parag18081994</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/parag18081994"/>
    <language>en</language>
    <item>
      <title>Exploring Tree-Inorder Traversal</title>
      <dc:creator>Parag</dc:creator>
      <pubDate>Tue, 16 Nov 2021 09:07:58 +0000</pubDate>
      <link>https://dev.to/parag18081994/exploring-tree-inorder-traversal-4l9f</link>
      <guid>https://dev.to/parag18081994/exploring-tree-inorder-traversal-4l9f</guid>
      <description>&lt;p&gt;In last post Introduction to tree data structures, I have give a brief introduction about tree data structure and its applications. Traversing a tree data structure is interesting as well as complicated as compare to linear data structures. Unlike arrays or linked list which are traversed in linear order, tree data structure can we traversed in multiple ways like depth first order (inorder, preorder, postorder) and breadth first order(level order traversal).&lt;br&gt;
Read more-&lt;br&gt;
&lt;a href="https://paragnaik2019.medium.com/exploring-tree-inorder-traversal-70250862d5b1"&gt;https://paragnaik2019.medium.com/exploring-tree-inorder-traversal-70250862d5b1&lt;/a&gt;&lt;/p&gt;

</description>
      <category>python</category>
      <category>beginners</category>
      <category>tutorial</category>
      <category>computerscience</category>
    </item>
    <item>
      <title>Introduction to Tree data structures</title>
      <dc:creator>Parag</dc:creator>
      <pubDate>Fri, 05 Nov 2021 07:26:17 +0000</pubDate>
      <link>https://dev.to/parag18081994/introduction-to-tree-data-structures-1leb</link>
      <guid>https://dev.to/parag18081994/introduction-to-tree-data-structures-1leb</guid>
      <description>&lt;p&gt;In the realm of data structures, Linked list, array can be described as a linear data structure unlike trees which are non-linear, hierarchical data structures.&lt;br&gt;
Read more-&lt;br&gt;
&lt;a href="https://paragnaik2019.medium.com/introduction-to-tree-data-structures-31c7976979a5"&gt;https://paragnaik2019.medium.com/introduction-to-tree-data-structures-31c7976979a5&lt;/a&gt;&lt;/p&gt;

</description>
      <category>beginners</category>
      <category>programming</category>
      <category>tutorial</category>
      <category>computerscience</category>
    </item>
    <item>
      <title>Hackerrank-Circular Array Rotation</title>
      <dc:creator>Parag</dc:creator>
      <pubDate>Wed, 13 Oct 2021 12:07:31 +0000</pubDate>
      <link>https://dev.to/parag18081994/hackerrank-circular-array-rotation-2g0d</link>
      <guid>https://dev.to/parag18081994/hackerrank-circular-array-rotation-2g0d</guid>
      <description>&lt;p&gt;John Watson knows of an operation called a right circular rotation on an array of integers. One rotation operation moves the last array element to the first position and shifts all remaining elements right one. To test Sherlock’s abilities, Watson provides Sherlock with an array of integers. Sherlock is to perform the rotation operation a number of times then determine the value of the element at a given position. For each array, perform a number of right circular rotations and return the values of the elements at the given indices.&lt;br&gt;
&lt;a href="https://paragnaik2019.medium.com/circular-array-rotation-94267efaf348"&gt;https://paragnaik2019.medium.com/circular-array-rotation-94267efaf348&lt;/a&gt;&lt;/p&gt;

</description>
      <category>python</category>
      <category>leetcode</category>
      <category>hackerrank</category>
    </item>
    <item>
      <title>Beautiful Triplets</title>
      <dc:creator>Parag</dc:creator>
      <pubDate>Wed, 13 Oct 2021 06:07:50 +0000</pubDate>
      <link>https://dev.to/parag18081994/beautiful-triplets-28a2</link>
      <guid>https://dev.to/parag18081994/beautiful-triplets-28a2</guid>
      <description>&lt;p&gt;&lt;a href="https://paragnaik2019.medium.com/beautiful-triplets-ce91af89d067"&gt;https://paragnaik2019.medium.com/beautiful-triplets-ce91af89d067&lt;/a&gt;&lt;/p&gt;

</description>
      <category>hackerrank</category>
      <category>leetcode</category>
      <category>python</category>
    </item>
    <item>
      <title>The “Hello world” of Data Structure-Linked List.</title>
      <dc:creator>Parag</dc:creator>
      <pubDate>Wed, 13 Oct 2021 05:40:39 +0000</pubDate>
      <link>https://dev.to/parag18081994/the-hello-world-of-data-structure-linked-list-56ik</link>
      <guid>https://dev.to/parag18081994/the-hello-world-of-data-structure-linked-list-56ik</guid>
      <description>&lt;p&gt;Linked is type of linear data structure which is widely use to solve specific problem raise due to the limitation of arrays.&lt;br&gt;
Linked list can be define as linear data structure in which the elements are not stored in contiguous memory location. In Laymen terms we can say a linked list is a collection of nodes in which each node has a data and the reference to the next node.&lt;br&gt;
&lt;a href="https://paragnaik2019.medium.com/the-hello-world-of-data-structure-linked-list-159bba7e4044"&gt;https://paragnaik2019.medium.com/the-hello-world-of-data-structure-linked-list-159bba7e4044&lt;/a&gt;&lt;/p&gt;

</description>
      <category>python</category>
      <category>datastructureandalgo</category>
      <category>algorithms</category>
      <category>programming</category>
    </item>
    <item>
      <title>Leetcode-206 :-Reverse Linked List</title>
      <dc:creator>Parag</dc:creator>
      <pubDate>Wed, 13 Oct 2021 05:38:11 +0000</pubDate>
      <link>https://dev.to/parag18081994/leetcode-206-reverse-linked-list-h47</link>
      <guid>https://dev.to/parag18081994/leetcode-206-reverse-linked-list-h47</guid>
      <description>&lt;p&gt;Given the head of a singly linked list, reverse the list, and return the reversed list&lt;br&gt;
&lt;a href="https://paragnaik2019.medium.com/leetcode-206-reverse-linked-list-30ce4fa2b09"&gt;https://paragnaik2019.medium.com/leetcode-206-reverse-linked-list-30ce4fa2b09&lt;/a&gt;&lt;/p&gt;

</description>
      <category>python</category>
      <category>programming</category>
      <category>leetcode</category>
    </item>
  </channel>
</rss>
