<?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: Yashwanth Sai</title>
    <description>The latest articles on DEV Community by Yashwanth Sai (@theyashwanthsai).</description>
    <link>https://dev.to/theyashwanthsai</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%2F708163%2Fa2d7b34b-5297-427c-b5f7-89e981929a4c.jpeg</url>
      <title>DEV Community: Yashwanth Sai</title>
      <link>https://dev.to/theyashwanthsai</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/theyashwanthsai"/>
    <language>en</language>
    <item>
      <title>Kali Linux Install Guide for Ethical Hacking</title>
      <dc:creator>Yashwanth Sai</dc:creator>
      <pubDate>Wed, 27 Jul 2022 06:52:58 +0000</pubDate>
      <link>https://dev.to/theyashwanthsai/kali-linux-install-guide-for-ethical-hacking-1j3h</link>
      <guid>https://dev.to/theyashwanthsai/kali-linux-install-guide-for-ethical-hacking-1j3h</guid>
      <description>&lt;p&gt;Want to install Kali linux - the hackers paradise?&lt;/p&gt;

&lt;p&gt;This small and short article will help you install kali linux. Now, if you are learning ethical hacking, then you would need Kali linux (or Parrot os). You should most likely be using Virtual Machines as most of us use it to learn. It makes our lives simple as compared to using the os bare metal.&lt;/p&gt;

&lt;p&gt;As a mac user I use &lt;a href="https://www.virtualbox.org/wiki/Downloads"&gt;Oracle VirtualBox&lt;/a&gt;. You can use &lt;a href="https://www.vmware.com/in/products/workstation-player/workstation-player-evaluation.html"&gt;VMware&lt;/a&gt; as well.&lt;/p&gt;

&lt;p&gt;Download &lt;a href="https://www.kali.org/get-kali/#kali-virtual-machines"&gt;Kali Linux&lt;/a&gt; VMware or VirtualBox images as preferred by you&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--v_qvRIrr--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/ofxw1r52aieeikn0uohm.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--v_qvRIrr--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/ofxw1r52aieeikn0uohm.png" alt="Image description" width="880" height="501"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Once it is done, open VirtualBox&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--DtJns5rj--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/ltkiw0hhbzo9ehyu6rfh.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--DtJns5rj--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/ltkiw0hhbzo9ehyu6rfh.png" alt="Image description" width="880" height="397"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Click on import &lt;/p&gt;

&lt;p&gt;Now click on the file directory and navigate the location where your Kali Linux file is located.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--x6Q0_XLg--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/2mi0t1ox61xsqx437icj.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--x6Q0_XLg--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/2mi0t1ox61xsqx437icj.png" alt="Image description" width="880" height="623"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Select the .ova file or .ovf file&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--YlogjUD7--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/xg8pic4hfl0gqnqn4oef.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--YlogjUD7--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/xg8pic4hfl0gqnqn4oef.png" alt="Image description" width="880" height="656"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Click on the import button&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--bbgZT3Nk--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/tq42escocs7y1m30b3b9.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--bbgZT3Nk--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/tq42escocs7y1m30b3b9.png" alt="Image description" width="880" height="626"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Now wait for some time.&lt;/p&gt;

&lt;p&gt;………………….&lt;/p&gt;

&lt;p&gt;You will now have something like this. Click the start button and your Kali Linux will start booting.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--PIkTipbC--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/juz2yn9np6hmuy5ljnpg.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--PIkTipbC--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/juz2yn9np6hmuy5ljnpg.png" alt="Image description" width="880" height="550"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;The Username: kali&lt;br&gt;
Password: kali&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--x5AnZmVF--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/5mm200wus94wlwy49bhq.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--x5AnZmVF--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/5mm200wus94wlwy49bhq.png" alt="Image description" width="880" height="550"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;There you have it.&lt;/p&gt;

&lt;p&gt;Next article will focus on getting familiar with Kali Linix.&lt;/p&gt;

</description>
    </item>
    <item>
      <title>Linked List in C.</title>
      <dc:creator>Yashwanth Sai</dc:creator>
      <pubDate>Thu, 09 Jun 2022 17:53:52 +0000</pubDate>
      <link>https://dev.to/theyashwanthsai/linked-list-in-c-3idd</link>
      <guid>https://dev.to/theyashwanthsai/linked-list-in-c-3idd</guid>
      <description>&lt;h2&gt;
  
  
  Linked List
&lt;/h2&gt;

&lt;p&gt;This article covers single linked list.&lt;/p&gt;

&lt;p&gt;A Linked List is basically nodes connected or linked to each other. We will discuss how they are linked together.&lt;/p&gt;

&lt;p&gt;A node is basically a block which contains a data and a pointer which points to the data of the next node’s data or points to null if that block is the last node in the list.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--nThpOFoh--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/7t50ph5j3y6jpeehqn2v.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--nThpOFoh--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/7t50ph5j3y6jpeehqn2v.png" alt="Node. &amp;lt;br&amp;gt;
taken from https://www.alphacodingskills.com/ds/notes/linked-list.php  " width="720" height="208"&gt;&lt;/a&gt;&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight c"&gt;&lt;code&gt;&lt;span class="k"&gt;struct&lt;/span&gt; &lt;span class="n"&gt;node&lt;/span&gt;
&lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;data&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="k"&gt;struct&lt;/span&gt; &lt;span class="n"&gt;node&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="n"&gt;next&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;span class="p"&gt;};&lt;/span&gt;
&lt;span class="c1"&gt;// We created a structure named node. It has data and a pointer named next.&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;How to initialise the linkedlist?&lt;/p&gt;

&lt;p&gt;In the main function, We first create a node called head which is the first node and it is used as reference node to transverse through the list.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight c"&gt;&lt;code&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="nf"&gt;main&lt;/span&gt;&lt;span class="p"&gt;()&lt;/span&gt;
&lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="k"&gt;struct&lt;/span&gt; &lt;span class="n"&gt;node&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="n"&gt;head&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
        &lt;span class="c1"&gt;// creating head node&lt;/span&gt;
    &lt;span class="n"&gt;head&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="k"&gt;struct&lt;/span&gt; &lt;span class="n"&gt;node&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="n"&gt;malloc&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="k"&gt;sizeof&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="k"&gt;struct&lt;/span&gt; &lt;span class="n"&gt;node&lt;/span&gt;&lt;span class="p"&gt;));&lt;/span&gt;
        &lt;span class="c1"&gt;// allocating memory&lt;/span&gt;
    &lt;span class="n"&gt;head&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;data&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;45&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
        &lt;span class="c1"&gt;// head node's data &lt;/span&gt;
    &lt;span class="n"&gt;head&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;next&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;NULL&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
        &lt;span class="c1"&gt;// head node's next pointer points to null as we have only one element.&lt;/span&gt;

    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;We now have a list with one element 45.&lt;/p&gt;

&lt;p&gt;We can simply add more values for the time being to see how it works.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight c"&gt;&lt;code&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="nf"&gt;main&lt;/span&gt;&lt;span class="p"&gt;()&lt;/span&gt;
&lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="k"&gt;struct&lt;/span&gt; &lt;span class="n"&gt;node&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="n"&gt;head&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="n"&gt;head&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="k"&gt;struct&lt;/span&gt; &lt;span class="n"&gt;node&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="n"&gt;malloc&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="k"&gt;sizeof&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="k"&gt;struct&lt;/span&gt; &lt;span class="n"&gt;node&lt;/span&gt;&lt;span class="p"&gt;));&lt;/span&gt;
    &lt;span class="n"&gt;head&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;data&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;5&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="n"&gt;head&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;next&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;NULL&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;

    &lt;span class="k"&gt;struct&lt;/span&gt; &lt;span class="n"&gt;node&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="n"&gt;current&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="k"&gt;struct&lt;/span&gt; &lt;span class="n"&gt;node&lt;/span&gt; &lt;span class="o"&gt;*&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;&lt;span class="n"&gt;malloc&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="k"&gt;sizeof&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="k"&gt;struct&lt;/span&gt; &lt;span class="n"&gt;node&lt;/span&gt;&lt;span class="p"&gt;));&lt;/span&gt;
    &lt;span class="n"&gt;current&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;data&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;98&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="n"&gt;current&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;next&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;NULL&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
        &lt;span class="c1"&gt;// we create a second node current and the next pointer points to null as only two elements are present.&lt;/span&gt;
    &lt;span class="n"&gt;head&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;next&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;current&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
        &lt;span class="c1"&gt;// we assign the head node's next pointer to current. That means it stores the address of 98.   &lt;/span&gt;

    &lt;span class="n"&gt;current&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;malloc&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="k"&gt;sizeof&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="k"&gt;struct&lt;/span&gt; &lt;span class="n"&gt;node&lt;/span&gt;&lt;span class="p"&gt;));&lt;/span&gt;
    &lt;span class="n"&gt;current&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;data&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;34&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="n"&gt;current&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;next&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;NULL&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
        &lt;span class="c1"&gt;// we assign this node's next pointer to null.&lt;/span&gt;
    &lt;span class="n"&gt;head&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;next&lt;/span&gt;&lt;span class="o"&gt;-&amp;gt;&lt;/span&gt;&lt;span class="n"&gt;next&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;current&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
        &lt;span class="c1"&gt;// head-&amp;gt;next-&amp;gt;next should point to the address of 34. &lt;/span&gt;

    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;This code should give me a list &lt;/p&gt;

&lt;p&gt;5 98 34&lt;/p&gt;

&lt;p&gt;The first node contains integer data 5 and address of 98, Second node contains data 98 and address of 34. The third node contains 34 and next pointer points to null.&lt;/p&gt;

&lt;p&gt;In the next article, Further operations on linked list will be covered.&lt;/p&gt;

</description>
    </item>
    <item>
      <title>VS Code Setup, Themes, Fonts for 2022</title>
      <dc:creator>Yashwanth Sai</dc:creator>
      <pubDate>Fri, 14 Jan 2022 18:02:00 +0000</pubDate>
      <link>https://dev.to/theyashwanthsai/vs-code-setup-themes-fonts-for-2022-18hh</link>
      <guid>https://dev.to/theyashwanthsai/vs-code-setup-themes-fonts-for-2022-18hh</guid>
      <description>&lt;p&gt;Good environment == Increased productivity. &lt;/p&gt;

&lt;p&gt;I use VS Code to learn programming and build projects. It took me time but i have mastered using VS Code efficiently. In this post I will show you my theme(s) and fonts. In the next few posts I will talk about how to boost your productivity and work flow while coding in VS Code.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--bVhF_f3w--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/kpnrc4elh7wt4h65se6x.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--bVhF_f3w--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/kpnrc4elh7wt4h65se6x.png" alt="Image description" width="880" height="550"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;I have hidden the Panel(cmd+j), Activity bar and Side bar(cmd+b). &lt;br&gt;
You can always add the Activity bar but for me personally Activity bar is a bit distracting. It can be added or removed easily. Go to View &amp;gt;&amp;gt; Appearance &amp;gt;&amp;gt; Show Activity bar.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--F3GldNB7--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/xm7xod6gysih48xytj81.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--F3GldNB7--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/xm7xod6gysih48xytj81.png" alt="Image description" width="880" height="550"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;This much is enough for me to be focused on code. I still have the mini map, it looks cool and doesn’t really distract me.&lt;/p&gt;

&lt;p&gt;Themes - &lt;/p&gt;

&lt;p&gt;The one I currently use is Shades of Purple.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--G2_jzwHm--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/1v0g31ee4rzm4j5wjh18.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--G2_jzwHm--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/1v0g31ee4rzm4j5wjh18.png" alt="Image description" width="880" height="550"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;The others which I really like -&lt;/p&gt;

&lt;p&gt;Winter is coming (Dark Blue)&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--iDplC4Bt--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/k37g1yerrabet3evdxtl.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--iDplC4Bt--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/k37g1yerrabet3evdxtl.png" alt="Image description" width="880" height="550"&gt;&lt;/a&gt;&lt;/p&gt;




&lt;p&gt;Palenight Theme&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--Y8vrXidS--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/5ofj17gqsl8j14ftznbd.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--Y8vrXidS--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/5ofj17gqsl8j14ftznbd.png" alt="Image description" width="880" height="550"&gt;&lt;/a&gt;&lt;/p&gt;




&lt;p&gt;One Dark Pro&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--Kl7o3sWs--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/d1jnef2zrcrfk1g73rp5.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--Kl7o3sWs--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/d1jnef2zrcrfk1g73rp5.png" alt="Image description" width="880" height="550"&gt;&lt;/a&gt;&lt;/p&gt;




&lt;p&gt;Monokai Classic&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--IQ3e-fCD--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/hphm9750d4ux9r5d73ss.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--IQ3e-fCD--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/hphm9750d4ux9r5d73ss.png" alt="Image description" width="880" height="550"&gt;&lt;/a&gt;&lt;/p&gt;




&lt;p&gt;Dracula&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--KHAY61WQ--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/2lyx1lfdbx1efoeq0vrm.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--KHAY61WQ--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/2lyx1lfdbx1efoeq0vrm.png" alt="Image description" width="880" height="550"&gt;&lt;/a&gt;&lt;/p&gt;




&lt;p&gt;Abyss&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--NtrqYDiY--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/e7m5ggk7ssfdkqeezdnd.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--NtrqYDiY--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/e7m5ggk7ssfdkqeezdnd.png" alt="Image description" width="880" height="550"&gt;&lt;/a&gt;&lt;/p&gt;




&lt;p&gt;Red&lt;/p&gt;

&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--p4FjZ9fl--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/vx6omlvdzajwa04xktb9.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--p4FjZ9fl--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/vx6omlvdzajwa04xktb9.png" alt="Image description" width="880" height="550"&gt;&lt;/a&gt;&lt;/p&gt;




&lt;p&gt;Fonts - &lt;/p&gt;

&lt;p&gt;The one I use is Cascadia Code. The number fonts are really good looking.&lt;/p&gt;

&lt;p&gt;The one I recommend is Fira Code, very popular and free.&lt;/p&gt;

</description>
      <category>vscode</category>
      <category>programming</category>
      <category>beginners</category>
      <category>productivity</category>
    </item>
    <item>
      <title>My First Hackathon</title>
      <dc:creator>Yashwanth Sai</dc:creator>
      <pubDate>Thu, 13 Jan 2022 06:48:01 +0000</pubDate>
      <link>https://dev.to/theyashwanthsai/my-first-hackathon-14jh</link>
      <guid>https://dev.to/theyashwanthsai/my-first-hackathon-14jh</guid>
      <description>&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--vBeKGYnF--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/02bcufkeqb0mu5fipm4b.jpeg" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--vBeKGYnF--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/02bcufkeqb0mu5fipm4b.jpeg" alt="Image description" width="621" height="1280"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Intro&lt;/p&gt;

&lt;p&gt;On 12th November 2021, I took part in my first Hackathon conducted by my college. This post is all about my experience with hackathons and also working in a team(which was quite new to me).&lt;br&gt;
Our App &lt;a href="https://github.com/theyashwanthsai/Maver-inGENIUS"&gt;Maver&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;So the hackathon was about developing an idea which would help us become a better developer. An idea which could be scaled into a product. It was a 24 hour hackathon and we had to stay awake overnight and come up with a product.&lt;/p&gt;

&lt;p&gt;Our idea was an app which would help students manage their monthly finance. With few inputs from our mentors we were able to make an app which was a great deal for us.&lt;/p&gt;

&lt;p&gt;We made a Github repo and made it a public project. With more development in coming days we are sure to make a better application. Our team used MIT App Inventor(embarrassing) and added few features to the app. My teammate helped make the gui much better while i was working on database. We used Firebase DB and we managed to make something out of it. &lt;/p&gt;

&lt;p&gt;Final takeaways:-&lt;/p&gt;

&lt;p&gt;Using MIT App Inventor was not really a good idea since we were not equipped with right of amount of knowledge. Knowledge of  basic Javascript and knowing react.js would have placed us miles above. I should also focus on creating more projects.&lt;br&gt;
Frontend is something not to be ignored and recently I have focused more on frontend part.&lt;/p&gt;

&lt;p&gt;Need to focus on communication with teammates. I was lucky my teammate understood what was to be done and we somehow made something to show to the evaluators.&lt;/p&gt;

&lt;p&gt;In the end, I made friends, learnt about team management and about how a product is made from idea part to execution part.&lt;/p&gt;

</description>
      <category>productivity</category>
      <category>hackathon</category>
      <category>beginners</category>
      <category>programming</category>
    </item>
  </channel>
</rss>
