<?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: Seenivasan A</title>
    <description>The latest articles on DEV Community by Seenivasan A (@seenivasan_a).</description>
    <link>https://dev.to/seenivasan_a</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.us-east-2.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F3924113%2Fbd65e3f5-6538-4085-a7f5-ed8c7a389dc9.jpeg</url>
      <title>DEV Community: Seenivasan A</title>
      <link>https://dev.to/seenivasan_a</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/seenivasan_a"/>
    <language>en</language>
    <item>
      <title>Python-Sets</title>
      <dc:creator>Seenivasan A</dc:creator>
      <pubDate>Thu, 04 Jun 2026 17:47:14 +0000</pubDate>
      <link>https://dev.to/seenivasan_a/python-sets-3i5a</link>
      <guid>https://dev.to/seenivasan_a/python-sets-3i5a</guid>
      <description>&lt;p&gt;Set is used to store a collection of items with the following properties.&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;No duplicate elements. If you try to insert the same item again, it is ignored because sets store only unique values.&lt;/li&gt;
&lt;li&gt;An unordered collection. When we access all items, they are accessed without any specific order and we cannot access items using indexes as we do in lists.&lt;/li&gt;
&lt;li&gt;Internally use hashing that makes set efficient for search, insert and delete operations. It gives a major advantage over a list for problems with these operations.&lt;/li&gt;
&lt;li&gt;Mutable, meaning we can add or remove elements after their creation, the individual elements within the set cannot be changed directly.
&lt;/li&gt;
&lt;/ul&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="n"&gt;s&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;&lt;span class="mi"&gt;10&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;50&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;20&lt;/span&gt;&lt;span class="p"&gt;}&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;s&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nf"&gt;type&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;s&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;br&gt;
{10, 50, 20}&lt;br&gt;
&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Method    |Shortcut&lt;/strong&gt; |&lt;strong&gt;Description&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;add()            Adds an element to the set&lt;/li&gt;
&lt;li&gt;clear()       Removes all the elements from the set&lt;/li&gt;
&lt;li&gt;copy()        Returns a copy of the set&lt;/li&gt;
&lt;li&gt;difference()  -   Returns a set containing the difference between two or more sets&lt;/li&gt;
&lt;li&gt;difference_update()   -=  Removes the items in this set that are also included in another, specified set&lt;/li&gt;
&lt;li&gt;discard()     Remove the specified item&lt;/li&gt;
&lt;li&gt;intersection()    &amp;amp;   Returns a set, that is the intersection of two other sets&lt;/li&gt;
&lt;li&gt;intersection_update() &amp;amp;=  Removes the items in this set that are not present in other, specified set(s)&lt;/li&gt;
&lt;li&gt;isdisjoint()      Returns True if NO items of this set is present in another set&lt;/li&gt;
&lt;li&gt;issubset()    &amp;lt;=  Returns True if all items of this set is present in another set&lt;/li&gt;
&lt;li&gt;  &amp;lt;   Returns True if all items of this set is present in another, larger set&lt;/li&gt;
&lt;li&gt;issuperset()  &amp;gt;=  Returns True if all items of another set is present in this set&lt;/li&gt;
&lt;li&gt;  &amp;gt;   Returns True if all items of another, smaller set is present in this set&lt;/li&gt;
&lt;li&gt;pop()     Removes an element from the set&lt;/li&gt;
&lt;li&gt;remove()      Removes the specified element&lt;/li&gt;
&lt;li&gt;symmetric_difference()    ^   Returns a set with the symmetric differences of two sets&lt;/li&gt;
&lt;li&gt;symmetric_difference_update() ^=  Inserts the symmetric differences from this set and another&lt;/li&gt;
&lt;li&gt;union()   |   Return a set containing the union of sets&lt;/li&gt;
&lt;li&gt;update()  |=  Update the set with the union of this set and others&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Check unique and Immutable&lt;/strong&gt;&lt;br&gt;
Sets cannot have duplicate values. While you cannot modify the individual elements directly, you can still add or remove elements from the set.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="c1"&gt;# a set cannot have duplicate values
&lt;/span&gt;&lt;span class="n"&gt;s&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;Geeks&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;for&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;Geeks&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;}&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;s&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;

&lt;span class="c1"&gt;# values of a set cannot be changed
&lt;/span&gt;&lt;span class="n"&gt;s&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;Hello&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;s&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;{'Geeks', 'for'}&lt;br&gt;
TypeError: 'set' object does not support item assignment&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Python frozenset&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;frozenset is an immutable version of a set.&lt;/li&gt;
&lt;li&gt;Like sets, it contains unique, unordered, unchangeable elements.&lt;/li&gt;
&lt;li&gt;Unlike sets, elements cannot be added or removed from a frozenset.
&lt;/li&gt;
&lt;/ul&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nf"&gt;frozenset&lt;/span&gt;&lt;span class="p"&gt;([&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;3&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;4&lt;/span&gt;&lt;span class="p"&gt;])&lt;/span&gt;
&lt;span class="n"&gt;b&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nf"&gt;frozenset&lt;/span&gt;&lt;span class="p"&gt;([&lt;/span&gt;&lt;span class="mi"&gt;3&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;4&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;5&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;6&lt;/span&gt;&lt;span class="p"&gt;])&lt;/span&gt;

&lt;span class="n"&gt;c&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;copy&lt;/span&gt;&lt;span class="p"&gt;()&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;c&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;

&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;union&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;intersection&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;difference&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;symmetric_difference&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;br&gt;
frozenset({1, 2, 3, 4})&lt;br&gt;
frozenset({1, 2, 3, 4, 5, 6})&lt;br&gt;
frozenset({3, 4})&lt;br&gt;
frozenset({1, 2})&lt;br&gt;
frozenset({1, 2, 5, 6})&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Method&lt;/strong&gt;  |&lt;strong&gt;Shortcut&lt;/strong&gt;   |&lt;strong&gt;Description&lt;/strong&gt;    &lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;copy()        Returns a shallow copy
&lt;/li&gt;
&lt;li&gt;difference()  -   Returns a new frozenset with the difference &lt;/li&gt;
&lt;li&gt;intersection()    &amp;amp;   Returns a new frozenset with the intersection
&lt;/li&gt;
&lt;li&gt;isdisjoint()      Returns True if there is NO intersection between two frozensets &lt;/li&gt;
&lt;li&gt;issubset()    &amp;lt;= / &amp;lt;  Returns True if this frozenset is a (proper) subset of another
&lt;/li&gt;
&lt;li&gt;issuperset()  &amp;gt;= / &amp;gt;  Returns True if this frozenset is a (proper) superset of another
&lt;/li&gt;
&lt;li&gt;symmetric_difference()    ^   Returns a new frozenset with the symmetric differences
&lt;/li&gt;
&lt;li&gt;union()   |   Returns a new frozenset containing the union&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Internal working of Set&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Python sets are implemented using a hash table, similar to dictionaries, where the set elements are stored as keys with dummy values. If multiple elements map to the same index, Python handles the collision by storing them in the same bucket.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;The diagram below illustrates how sets internally manage collisions to support efficient insertion, deletion, and lookup operations.&lt;br&gt;
&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4hj8asfx71x2djfh6c0r.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F4hj8asfx71x2djfh6c0r.png" alt=" "&gt;&lt;/a&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Each index in the hash table represents a possible hash value where elements are stored based on their computed hash key.&lt;/li&gt;
&lt;li&gt;When two elements map to the same index, they are linked together using a linked list, forming a chain at that position.&lt;/li&gt;
&lt;li&gt;This chaining mechanism helps efficiently handle collisions, allowing multiple elements to exist at the same hash index without overwriting each other.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvhfteqnvkbrl5udjh2pt.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fvhfteqnvkbrl5udjh2pt.png" alt=" "&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;References&lt;/strong&gt;&lt;br&gt;
&lt;a href="https://www.geeksforgeeks.org/python/sets-in-python/" rel="noopener noreferrer"&gt;https://www.geeksforgeeks.org/python/sets-in-python/&lt;/a&gt;&lt;br&gt;
&lt;a href="https://www.w3schools.com/python/python_sets.asp" rel="noopener noreferrer"&gt;https://www.w3schools.com/python/python_sets.asp&lt;/a&gt;&lt;/p&gt;

</description>
      <category>ai</category>
      <category>programming</category>
      <category>python</category>
      <category>beginners</category>
    </item>
    <item>
      <title>Python-List,Tuples</title>
      <dc:creator>Seenivasan A</dc:creator>
      <pubDate>Wed, 03 Jun 2026 17:25:48 +0000</pubDate>
      <link>https://dev.to/seenivasan_a/python-listtuples-nc6</link>
      <guid>https://dev.to/seenivasan_a/python-listtuples-nc6</guid>
      <description>&lt;p&gt;&lt;strong&gt;List&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;A List is an ordered collection of items that can store different types of data such as numbers, strings, or even other lists. Lists are mutable, which means their contents can be modified after creation.&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Lists are one of 4 built-in data types in Python used to store collections of data, the other 3 are Tuple, Set, and Dictionary, all with different qualities and usage.&lt;/li&gt;
&lt;li&gt;List is a built-in data structure used to store an ordered collection of items. They are dynamic, resizable and capable of storing multiple data types.&lt;/li&gt;
&lt;li&gt;Mutable: list elements can be changed, updated, added, or removed after the list is created.&lt;/li&gt;
&lt;li&gt;Ordered: elements maintain the order in which they are inserted.&lt;/li&gt;
&lt;li&gt;Index-based: elements are accessed using their position, starting from index 0.
&lt;/li&gt;
&lt;/ul&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;3&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;

&lt;span class="n"&gt;b&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;apple&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;banana&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;

&lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nf"&gt;list&lt;/span&gt;&lt;span class="p"&gt;((&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;3&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="s"&gt;apple&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mf"&gt;4.5&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;  
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;a&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;

&lt;span class="n"&gt;b&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nf"&gt;list&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;GFG&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;b&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;br&gt;
[1, 2, 3]&lt;br&gt;
['apple', 'banana']&lt;br&gt;
[1, 2, 3, 'apple', 4.5]&lt;br&gt;
['G', 'F', 'G']&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Method&lt;/strong&gt;        &lt;strong&gt;Description&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;append()    Adds an element at the end of the list&lt;/li&gt;
&lt;li&gt;clear()             Removes all the elements from the list&lt;/li&gt;
&lt;li&gt;copy()              Returns a copy of the list&lt;/li&gt;
&lt;li&gt;count()         Returns the number of elements with the specified value&lt;/li&gt;
&lt;li&gt;extend()    Add the elements of a list (or any iterable), to the end of the current list&lt;/li&gt;
&lt;li&gt;index()             Returns the index of the first element with the specified value&lt;/li&gt;
&lt;li&gt;insert()  Adds an element at the specified position&lt;/li&gt;
&lt;li&gt;pop() Removes the element at the specified position&lt;/li&gt;
&lt;li&gt;remove()  Removes the item with the specified value&lt;/li&gt;
&lt;li&gt;reverse() Reverses the order of the list&lt;/li&gt;
&lt;li&gt;sort()    Sorts the list&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Use Lists When:&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Data needs frequent updates.&lt;/li&gt;
&lt;li&gt;Elements need to be added or removed.&lt;/li&gt;
&lt;li&gt;Working with dynamic datasets.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Tuples&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;A Tuple is also an ordered collection of items, but unlike lists, tuples are immutable. Once a tuple is created, its values cannot be changed.&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Tuples are similar to lists, but unlike lists, they cannot be changed after their creation.&lt;/li&gt;
&lt;li&gt;Can hold elements of different data types.&lt;/li&gt;
&lt;li&gt;These are ordered, heterogeneous and immutable&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Tuples can store elements of different data types, such as integers, strings, lists and dictionaries, within a single structure.&lt;/p&gt;

&lt;p&gt;Tuples can be concatenated using the + operator. This operation combines two or more tuples to create a new tuple&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Method&lt;/strong&gt;   &lt;strong&gt;Description&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;count()   Returns the number of times a specified value occurs in a tuple&lt;/li&gt;
&lt;li&gt;index()   Searches the tuple for a specified value and returns the position of where it was found
&lt;/li&gt;
&lt;/ul&gt;
&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="n"&gt;tup&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;()&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;tup&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;

&lt;span class="c1"&gt;# Using String
&lt;/span&gt;&lt;span class="n"&gt;tup&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="s"&gt;Geeks&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="s"&gt;For&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;tup&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;

&lt;span class="c1"&gt;# Using List
&lt;/span&gt;&lt;span class="n"&gt;li&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;4&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;5&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;6&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nf"&gt;tuple&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;li&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;

&lt;span class="c1"&gt;# Using Built-in Function
&lt;/span&gt;&lt;span class="n"&gt;tup&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nf"&gt;tuple&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="s"&gt;Geeks&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;tup&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;


&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;br&gt;
()&lt;br&gt;
('Geeks', 'For')&lt;br&gt;
(1, 2, 4, 5, 6)&lt;br&gt;
('G', 'e', 'e', 'k', 's')&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Slicing of Tuple&lt;/strong&gt;&lt;br&gt;
Slicing a tuple means creating a new tuple from a subset of elements of the original tuple. The slicing syntax is tuple[start:stop:step].&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="n"&gt;tup&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nf"&gt;tuple&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="s"&gt;GEEKSFORGEEKS&lt;/span&gt;&lt;span class="sh"&gt;'&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;tup&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;:])&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;tup&lt;/span&gt;&lt;span class="p"&gt;[::&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;])&lt;/span&gt;
&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;tup&lt;/span&gt;&lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;4&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;&lt;span class="mi"&gt;9&lt;/span&gt;&lt;span class="p"&gt;])&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;br&gt;
('E', 'E', 'K', 'S', 'F', 'O', 'R', 'G', 'E', 'E', 'K', 'S')&lt;br&gt;
('S', 'K', 'E', 'E', 'G', 'R', 'O', 'F', 'S', 'K', 'E', 'E', 'G')&lt;br&gt;
('S', 'F', 'O', 'R', 'G')&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Use Tuples When:&lt;/strong&gt;&lt;br&gt;
Data should remain unchanged.&lt;br&gt;
Storing fixed information.&lt;br&gt;
Better performance is required.&lt;/p&gt;

&lt;p&gt;Lists and Tuples are fundamental data structures in Python. Lists provide flexibility because they can be modified, while Tuples provide safety and better performance because they cannot be changed. Choosing the right data structure depends on the application's requirements. Understanding these concepts helps programmers write more efficient and organized Python code.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;References&lt;/strong&gt;&lt;br&gt;
&lt;a href="https://www.w3schools.com/python/python_lists.asp" rel="noopener noreferrer"&gt;https://www.w3schools.com/python/python_lists.asp&lt;/a&gt;&lt;br&gt;
&lt;a href="https://www.geeksforgeeks.org/python/python-lists/" rel="noopener noreferrer"&gt;https://www.geeksforgeeks.org/python/python-lists/&lt;/a&gt;&lt;br&gt;
&lt;a href="https://www.geeksforgeeks.org/python/python-tuples/" rel="noopener noreferrer"&gt;https://www.geeksforgeeks.org/python/python-tuples/&lt;/a&gt;&lt;br&gt;
&lt;a href="https://www.w3schools.com/python/python_tuples.asp" rel="noopener noreferrer"&gt;https://www.w3schools.com/python/python_tuples.asp&lt;/a&gt;&lt;/p&gt;

</description>
      <category>ai</category>
      <category>programming</category>
      <category>career</category>
      <category>learning</category>
    </item>
    <item>
      <title>AI in Data Analytics</title>
      <dc:creator>Seenivasan A</dc:creator>
      <pubDate>Mon, 25 May 2026 19:02:59 +0000</pubDate>
      <link>https://dev.to/seenivasan_a/ai-in-data-analytics-58i5</link>
      <guid>https://dev.to/seenivasan_a/ai-in-data-analytics-58i5</guid>
      <description>&lt;p&gt;&lt;strong&gt;Why AI is Used in Data Analytics&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;AI is used because it saves time and reduces manual work. Data Analysts often spend many hours cleaning data and writing code. AI tools help complete these tasks faster and more accurately.&lt;/p&gt;

&lt;p&gt;Benefits of AI include:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Faster analysis&lt;/li&gt;
&lt;li&gt;Better accuracy&lt;/li&gt;
&lt;li&gt;Easy automation&lt;/li&gt;
&lt;li&gt;Quick visualization&lt;/li&gt;
&lt;li&gt;Faster code generation&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;AI also helps beginners understand coding concepts more easily.&lt;/p&gt;

&lt;p&gt;Recently, I attended a webinar conducted by Brand Monk Academy about how Artificial Intelligence (AI) is used in Data Analytics. The session explained how Data Analysts use AI tools to make their work easier, faster, and more efficient.&lt;/p&gt;

&lt;p&gt;The webinar mainly focused on four important topics:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Data Cleaning&lt;/li&gt;
&lt;li&gt;Data Visualization&lt;/li&gt;
&lt;li&gt;Automation&lt;/li&gt;
&lt;li&gt;Data Generation&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;These concepts are very important in modern Data Analytics because companies work with huge amounts of data every day.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Data Cleaning&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Data cleaning is the process of correcting or removing unwanted data from a dataset. Before analyzing data, it is important to make sure the data is accurate and organized properly.&lt;/p&gt;

&lt;p&gt;The speakers explained that datasets often contain:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Missing values&lt;/li&gt;
&lt;li&gt;Duplicate records&lt;/li&gt;
&lt;li&gt;Incorrect information&lt;/li&gt;
&lt;li&gt;Empty rows&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Cleaning the data helps improve accuracy and makes analysis easier. AI tools can now help automate this process and reduce manual work.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Data Visualization&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Data visualization means presenting data using charts, graphs, and dashboards. It helps people understand information more clearly.&lt;/p&gt;

&lt;p&gt;The webinar showed different visualization methods such as:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Bar charts&lt;/li&gt;
&lt;li&gt;Pie charts&lt;/li&gt;
&lt;li&gt;Line graphs&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Visualization helps businesses identify trends and make better decisions. AI tools can also suggest suitable charts automatically based on the data.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Automation&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Automation is one of the biggest advantages of AI in Data Analytics. Instead of doing repetitive tasks manually, analysts can use automation tools and code to complete tasks quickly.&lt;/p&gt;

&lt;p&gt;The speakers also explained how Excel Developer Options and VBA macros are used for automation.&lt;/p&gt;

&lt;p&gt;Some automated tasks include:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Data formatting&lt;/li&gt;
&lt;li&gt;Removing duplicates&lt;/li&gt;
&lt;li&gt;Creating reports&lt;/li&gt;
&lt;li&gt;Performing calculations automatically&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Automation saves time and improves productivity.&lt;/p&gt;

&lt;p&gt;The speakers also explained how Excel Developer Options and VBA macros are used for automation.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;Sub RemoveDuplicates()

    Range("A1:A10").RemoveDuplicates Columns:=1, Header:=xlNo

    MsgBox "Duplicate values removed successfully!"

End Sub
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;After the code, continue with this explanation:&lt;/p&gt;

&lt;p&gt;This VBA macro removes duplicate values from Excel data automatically and displays a completion message. VBA helps Data Analysts automate repetitive tasks and improve productivity while working with large datasets.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Google Colab and Gemini AI&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;One of the most interesting topics in the webinar was using Google Colab and Gemini AI for Data Analytics.&lt;/p&gt;

&lt;p&gt;Google Colab allows users to write and run Python code online without installing software. Gemini AI helps users generate code, create datasets, analyze data, and visualize information using simple prompts.&lt;/p&gt;

&lt;p&gt;The speakers demonstrated how AI can:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Generate Python code&lt;/li&gt;
&lt;li&gt;Create sample datasets&lt;/li&gt;
&lt;li&gt;Analyze CSV files&lt;/li&gt;
&lt;li&gt;Generate charts and graphs&lt;/li&gt;
&lt;li&gt;Explain coding errors&lt;/li&gt;
&lt;li&gt;Automate repetitive tasks&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;For example, users can simply ask Gemini AI to:&lt;/p&gt;

&lt;p&gt;“Create a bar chart for sales data”&lt;/p&gt;

&lt;p&gt;and AI can generate the required code automatically.&lt;/p&gt;

&lt;p&gt;This makes learning Data Analytics easier for beginners and improves productivity for professionals.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Will AI Replace Jobs?&lt;/strong&gt;&lt;br&gt;
One important discussion in the webinar was whether AI will replace Data Analyst jobs.&lt;/p&gt;

&lt;p&gt;The speakers explained that AI may automate some repetitive tasks, but it will mainly improve jobs rather than completely replace them. Human thinking, decision-making, creativity, and business understanding are still very important.&lt;/p&gt;

&lt;p&gt;AI works as a supporting tool for analysts by helping them:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Work faster&lt;/li&gt;
&lt;li&gt;Reduce errors&lt;/li&gt;
&lt;li&gt;Improve productivity&lt;/li&gt;
&lt;li&gt;Focus on important decisions&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;Therefore, learning AI tools can help Data Analysts improve their skills and grow in their careers.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Conclusion&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;The webinar provided a simple understanding of how AI is transforming Data Analytics. Concepts like data cleaning, visualization, automation, and AI-assisted coding are becoming essential in modern workplaces.&lt;/p&gt;

&lt;p&gt;Learning tools like Google Colab and Gemini AI can help students and professionals improve their technical knowledge and work more efficiently in the future.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Certificate&lt;/strong&gt;&lt;br&gt;
&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fjajr39hzgmta1c5durqc.jpg" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fjajr39hzgmta1c5durqc.jpg" alt=" " width="799" height="560"&gt;&lt;/a&gt;&lt;/p&gt;

</description>
      <category>ai</category>
      <category>datascience</category>
      <category>python</category>
      <category>automation</category>
    </item>
    <item>
      <title>CRACKING CODING INTERVIEW</title>
      <dc:creator>Seenivasan A</dc:creator>
      <pubDate>Sun, 24 May 2026 17:59:51 +0000</pubDate>
      <link>https://dev.to/seenivasan_a/cracking-coding-interview-485l</link>
      <guid>https://dev.to/seenivasan_a/cracking-coding-interview-485l</guid>
      <description>&lt;ol&gt;
&lt;li&gt;&lt;p&gt;Technical interviews at top companies like Google, Amazon, and Meta are often centered around coding and algorithm-based problem-solving. Many students feel nervous about these interviews because they are very different from regular academic exams. However, understanding the interview process can make preparation easier and more effective.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;In most software engineering interviews, candidates are given one or two coding problems and are expected to explain their thought process while solving them. Interviewers are not only checking whether the final answer is correct, but also evaluating how candidates think, communicate, and approach difficult problems.&lt;/p&gt;&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;&lt;strong&gt;What Interviewers Evaluate&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Interviewers generally focus on five important areas:&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;1. Analytical Skills&lt;/strong&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;&lt;ul&gt;
&lt;li&gt;This is one of the most important aspects of coding interviews. Interviewers observe how candidates analyze a problem, identify patterns, and choose efficient solutions.&lt;/li&gt;
&lt;/ul&gt;&lt;/li&gt;
&lt;li&gt;&lt;ul&gt;
&lt;li&gt;For example, if a candidate is asked to find duplicate elements in an array, a brute-force solution may work, but an optimized approach using a hash set demonstrates stronger problem-solving ability.&lt;/li&gt;
&lt;/ul&gt;&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;&lt;strong&gt;Example&lt;/strong&gt;&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="n"&gt;nums&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;3&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;2&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;4&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;5&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;]&lt;/span&gt;
&lt;span class="n"&gt;seen&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nf"&gt;set&lt;/span&gt;&lt;span class="p"&gt;()&lt;/span&gt;

&lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;num&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="n"&gt;nums&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;num&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="n"&gt;seen&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;Duplicate:&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;num&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
    &lt;span class="k"&gt;else&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="n"&gt;seen&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;add&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;num&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;&lt;strong&gt;Output&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Duplicate: 2&lt;br&gt;
Duplicate: 1&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;2. Coding Skills&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Writing clean and readable code is very important. Interviewers expect proper variable names, structured logic, and fewer syntax mistakes.&lt;/p&gt;

&lt;p&gt;Good coding style includes:&lt;/p&gt;

&lt;p&gt;Meaningful variable names&lt;br&gt;
Proper indentation&lt;br&gt;
Error handling&lt;br&gt;
Optimized logic&lt;/p&gt;

&lt;p&gt;Even small mistakes are acceptable if the candidate explains their logic clearly.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;3. Computer Science Fundamentals&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Strong knowledge of data structures and algorithms is extremely useful in interviews. Concepts like arrays, linked lists, stacks, queues, trees, graphs, sorting, and searching are commonly asked.&lt;/p&gt;

&lt;p&gt;For example, Binary Search is a popular interview topic because it demonstrates understanding of efficient searching techniques.&lt;/p&gt;

&lt;p&gt;f(n)=log2n&lt;/p&gt;

&lt;p&gt;Binary Search reduces the search space repeatedly, making it much faster than linear search.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fa4dzy8m2z5n3tivslev4.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fa4dzy8m2z5n3tivslev4.png" alt=" " width="799" height="493"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;&lt;em&gt;Important Data Structures and Algorithms Topics for Coding Interviews&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;4. Experience and Projects&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Interviewers also evaluate the projects candidates have worked on. Real-world projects demonstrate practical knowledge and problem-solving ability.&lt;/p&gt;

&lt;p&gt;For example, developing a Doctor Appointment Booking System with features like:&lt;/p&gt;

&lt;p&gt;Appointment scheduling&lt;br&gt;
Patient management&lt;br&gt;
Database handling&lt;br&gt;
Authentication systems&lt;/p&gt;

&lt;p&gt;shows strong practical exposure to development concepts.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;5. Communication Skills and Culture Fit&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Candidates who explain their ideas clearly usually perform better. Interviewers prefer people who can collaborate well with teams and communicate effectively.&lt;/p&gt;

&lt;p&gt;During interviews:&lt;/p&gt;

&lt;p&gt;Think aloud&lt;br&gt;
Explain your approach&lt;br&gt;
Discuss alternative solutions&lt;br&gt;
Ask clarifying questions when necessary&lt;/p&gt;

&lt;p&gt;Good communication often creates a positive impression.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Why Do Companies Use Coding Interviews?&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Many candidates question why companies focus heavily on algorithms and whiteboard coding. There are several reasons behind this approach.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Problem-Solving Ability&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Companies believe that candidates who solve difficult algorithmic problems are usually strong logical thinkers. Smart problem solvers often adapt quickly to new technologies and challenges.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Understanding Fundamentals&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Basic knowledge of computer science concepts helps developers choose better solutions in real-world applications. For example, knowing when to use a hash map or binary search tree can improve software performance significantly.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Whiteboard Coding Encourages Discussion&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Although whiteboard coding feels artificial, it helps interviewers understand how candidates think. It also encourages communication and explanation rather than relying completely on syntax or IDE suggestions.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Important Reality About Interviews&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;One important thing to understand is that interview evaluation is relative. Interviewers compare your performance with other candidates who solved the same question.&lt;/p&gt;

&lt;p&gt;Getting a difficult question does not mean failure. If a problem is hard for you, it is likely difficult for everyone else too.&lt;/p&gt;

&lt;p&gt;Interviewers mainly observe:&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Your thinking process&lt;/li&gt;
&lt;li&gt;Problem-solving approach&lt;/li&gt;
&lt;li&gt;Optimization ability&lt;/li&gt;
&lt;li&gt;Communication skills&lt;/li&gt;
&lt;li&gt;Confidence under pressure&lt;/li&gt;
&lt;/ol&gt;

&lt;ul&gt;
&lt;li&gt;&lt;p&gt;Coding interviews are not perfect, but they remain one of the most common methods companies use to evaluate software engineers. Success in these interviews depends not only on technical knowledge but also on communication, confidence, and structured thinking.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;Consistent practice, strong fundamentals, and real project experience can greatly improve interview performance. Instead of fearing coding interviews, candidates should treat them as opportunities to demonstrate their problem-solving abilities and technical skills.&lt;/p&gt;&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;*&lt;em&gt;Reference *&lt;/em&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;&lt;a href="https://www.crackingthecodinginterview.com/contents.html" rel="noopener noreferrer"&gt;https://www.crackingthecodinginterview.com/contents.html&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;
&lt;a href="https://leetcode.com/explore/interview/card/top-interview-questions-easy/" rel="noopener noreferrer"&gt;https://leetcode.com/explore/interview/card/top-interview-questions-easy/&lt;/a&gt;?&lt;/li&gt;
&lt;li&gt;&lt;a href="https://www.geeksforgeeks.org/dsa/dsa-tutorial-learn-data-structures-and-algorithms/" rel="noopener noreferrer"&gt;https://www.geeksforgeeks.org/dsa/dsa-tutorial-learn-data-structures-and-algorithms/&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;
&lt;a href="https://www.hackerrank.com/interview/interview-preparation-kit" rel="noopener noreferrer"&gt;https://www.hackerrank.com/interview/interview-preparation-kit&lt;/a&gt;?&lt;/li&gt;
&lt;/ul&gt;

</description>
      <category>interview</category>
      <category>programming</category>
      <category>ai</category>
      <category>analytics</category>
    </item>
    <item>
      <title>Strings and Loops in Python</title>
      <dc:creator>Seenivasan A</dc:creator>
      <pubDate>Fri, 22 May 2026 12:58:30 +0000</pubDate>
      <link>https://dev.to/seenivasan_a/strings-and-loops-in-python-25d3</link>
      <guid>https://dev.to/seenivasan_a/strings-and-loops-in-python-25d3</guid>
      <description>&lt;p&gt;&lt;strong&gt;String&lt;/strong&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Strings are sequence of characters written inside quotes. It can include letters, numbers, symbols and spaces. Python does not have a separate character type.&lt;/li&gt;
&lt;li&gt;Strings are immutable, meaning their values cannot be changed after creation. Any modification to a string creates a new string instead of altering the original one.&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;&lt;strong&gt;Common String Methods&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Python string methods is a collection of in-built Python functions that operates on strings.&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;upper()&lt;/li&gt;
&lt;li&gt;lower()&lt;/li&gt;
&lt;li&gt;find()&lt;/li&gt;
&lt;li&gt;split()&lt;/li&gt;
&lt;li&gt;strip()&lt;/li&gt;
&lt;li&gt;format()&lt;/li&gt;
&lt;li&gt;join()&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Discussed problems&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Reverse a String&lt;/li&gt;
&lt;li&gt;Password Authentication&lt;/li&gt;
&lt;li&gt;Parse csv "java","1","2","3".."6"&lt;/li&gt;
&lt;li&gt;Convert uppercase to lowercase&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Parse csv "java","1","2","3".."6"
&lt;/li&gt;
&lt;/ul&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="n"&gt;data&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nf"&gt;input&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;Enter CSV data: &lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;span class="n"&gt;values&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;data&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;split&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;,&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;span class="n"&gt;total&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;
&lt;span class="k"&gt;for&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="ow"&gt;in&lt;/span&gt; &lt;span class="n"&gt;values&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
    &lt;span class="n"&gt;i&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;strip&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="sh"&gt;'"'&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;isdigit&lt;/span&gt;&lt;span class="p"&gt;():&lt;/span&gt;
        &lt;span class="n"&gt;total&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="nf"&gt;int&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;

&lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;Total =&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="n"&gt;total&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Input-"java","1","2","3","4","5","6"&lt;/p&gt;

&lt;p&gt;Output-Total = 21&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Loop&lt;/strong&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Loops are used to execute a block of code repeatedly until a condition is met or all items in a sequence are processed. The main types are For loops (iterating over sequences) and While loops (executing code based on a condition).&lt;/li&gt;
&lt;li&gt;break is used to exit a for loop or a while loop, whereas continue is used to skip the current block, and return to the "for" or "while" statement.&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;&lt;strong&gt;While Loop Syntax&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;while condition:&lt;br&gt;
    statement&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;For Loop Syntax&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;for variable in range(start, stop, step):&lt;br&gt;
    statement&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Discussed problems&lt;/strong&gt;&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Sum of (N) numbers &lt;/li&gt;
&lt;li&gt;Multiplication table&lt;/li&gt;
&lt;li&gt;Print even numbers&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;&lt;strong&gt;Examples&lt;/strong&gt;&lt;br&gt;
Sum of (N) numbers&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight python"&gt;&lt;code&gt;&lt;span class="k"&gt;def&lt;/span&gt; &lt;span class="nf"&gt;sum_of_numbers&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;):&lt;/span&gt;
    &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;
    &lt;span class="nb"&gt;sum&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;
    &lt;span class="k"&gt;while&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="o"&gt;&amp;lt;=&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt;
        &lt;span class="nb"&gt;sum&lt;/span&gt;&lt;span class="o"&gt;+=&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;
        &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="o"&gt;+=&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;
    &lt;span class="nf"&gt;print&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;The sum of first&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;numbers is:&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;&lt;span class="nb"&gt;sum&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;

&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="nf"&gt;int&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nf"&gt;input&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="s"&gt;Enter the number of terms: &lt;/span&gt;&lt;span class="sh"&gt;"&lt;/span&gt;&lt;span class="p"&gt;))&lt;/span&gt;
&lt;span class="nf"&gt;sum_of_numbers&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Input-&amp;gt; N=10&lt;/p&gt;

&lt;p&gt;Output-&amp;gt; Sum=55&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Algorithms Discussed&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Merge Sort&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fu5vfegxp30yw3o64wtf3.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fu5vfegxp30yw3o64wtf3.png" alt=" " width="800" height="400"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Binary Search And Linear Search&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5ycwphzccomtakvec7jd.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F5ycwphzccomtakvec7jd.png" alt=" " width="800" height="675"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;References&lt;/strong&gt;&lt;br&gt;
&lt;a href="https://www.geeksforgeeks.org/dsa/merge-sort/" rel="noopener noreferrer"&gt;https://www.geeksforgeeks.org/dsa/merge-sort/&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;a href="https://tutorialhorizon.com/algorithms/linear-search-vs-binary-search/" rel="noopener noreferrer"&gt;https://tutorialhorizon.com/algorithms/linear-search-vs-binary-search/&lt;/a&gt;&lt;/p&gt;

</description>
      <category>python</category>
      <category>ai</category>
      <category>productivity</category>
      <category>programming</category>
    </item>
    <item>
      <title>GitLab</title>
      <dc:creator>Seenivasan A</dc:creator>
      <pubDate>Fri, 15 May 2026 17:38:57 +0000</pubDate>
      <link>https://dev.to/seenivasan_a/gitlab-33c0</link>
      <guid>https://dev.to/seenivasan_a/gitlab-33c0</guid>
      <description>&lt;p&gt;GitLab was found by Dmitriy Zaporozhets and Valery Sizov in October 2011. It was distributed under MIT license and the stable version of GitLab is 10.4 released in January 22, 2018.&lt;/p&gt;

&lt;p&gt;Gitlab is a service that provides remote access to Git repositories.&lt;/p&gt;

&lt;p&gt;These additional features include managing the sharing of code between different people, bug tracking, wiki space and other tools for 'social coding'.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Git&lt;/strong&gt;: A local tool installed on your computer to track code changes.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;GitHub / Bitbucket&lt;/strong&gt;: Remote websites used to host and share your Git code.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;GitLab&lt;/strong&gt;: A complete, all-in-one platform that hosts your code and automates your entire development process.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Why GitLab?&lt;/strong&gt;&lt;br&gt;
GitLab is a github like service that organizations can use to provide internal management of git repositories. It is a self hosted Git-repository management system that keeps the user code private and can easily deploy the changes of the code.&lt;/p&gt;

&lt;p&gt;GitLab is a user friendly web interface layer on top of Git, which increases the speed of working with Git.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;GitLab - Git Commands&lt;/strong&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;$ git --version&lt;/li&gt;
&lt;li&gt;$ git status&lt;/li&gt;
&lt;li&gt;$ git add *&lt;/li&gt;
&lt;li&gt;$ git push origin branch-name&lt;/li&gt;
&lt;li&gt;$ git pull origin NAME-OF-BRANCH -u&lt;/li&gt;
&lt;li&gt;$git checkout branch-name&lt;/li&gt;
&lt;li&gt;$ git merge master &lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;&lt;strong&gt;Authentication&lt;/strong&gt;&lt;br&gt;
 Id-(@username) in the profile.&lt;br&gt;
 Create personal access tokens. When you use 2FA, you can use these    tokens to access the GitLab API.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;To Be Discuss?&lt;/strong&gt;&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;GitLab provides its own Continuous Integration (CI) system for managing the projects and provides user interface along with other features of GitLab.&lt;/li&gt;
&lt;li&gt;GitLab - SSH Key Setup&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;&lt;a href="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fxm8i52bw0zbyl5ofy5mt.jpeg" class="article-body-image-wrapper"&gt;&lt;img src="https://media2.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fxm8i52bw0zbyl5ofy5mt.jpeg" alt=" " width="800" height="324"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;References&lt;/strong&gt;&lt;br&gt;
&lt;a href="https://www.tutorialspoint.com/gitlab/gitlab_introduction.htm" rel="noopener noreferrer"&gt;https://www.tutorialspoint.com/gitlab/gitlab_introduction.htm&lt;/a&gt;&lt;br&gt;
&lt;a href="https://suresoft.dev/knowledge-hub/continuous-integration/gitlab-ci/" rel="noopener noreferrer"&gt;https://suresoft.dev/knowledge-hub/continuous-integration/gitlab-ci/&lt;/a&gt;&lt;br&gt;
&lt;a href="https://docs.gitlab.com/administration/get_started/" rel="noopener noreferrer"&gt;https://docs.gitlab.com/administration/get_started/&lt;/a&gt;&lt;/p&gt;

</description>
      <category>gitlab</category>
      <category>git</category>
      <category>ai</category>
      <category>opensource</category>
    </item>
  </channel>
</rss>
