<?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: Raksha Kannusami </title>
    <description>The latest articles on DEV Community by Raksha Kannusami  (@rakshakannu).</description>
    <link>https://dev.to/rakshakannu</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%2F274024%2F35d4cda2-25bb-4247-b99f-52d726b9acf1.jpg</url>
      <title>DEV Community: Raksha Kannusami </title>
      <link>https://dev.to/rakshakannu</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/rakshakannu"/>
    <language>en</language>
    <item>
      <title>Why I want to write</title>
      <dc:creator>Raksha Kannusami </dc:creator>
      <pubDate>Wed, 27 Mar 2024 04:18:38 +0000</pubDate>
      <link>https://dev.to/rakshakannu/why-i-want-to-write-1io5</link>
      <guid>https://dev.to/rakshakannu/why-i-want-to-write-1io5</guid>
      <description>&lt;p&gt;I always thought writing would be a piece of cake for me until it took me a good half an hour to draft the first line of this post.&lt;/p&gt;

&lt;p&gt;If I had to draw a pie chart of what is going on in my mind at any given time, it would look like the following image -&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0g2133lbxi9555k3melb.png" class="article-body-image-wrapper"&gt;&lt;img src="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F0g2133lbxi9555k3melb.png" alt="pie-chart" width="280" height="354"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Since I am spending so much time reading, learning and exploring, I want to get out of my comfort zone to start writing more freqeuntly, and it would be perfect to start with things that I am familiar with - Technology, cats and coffee!&lt;/p&gt;

&lt;p&gt;I am a software engineer who loves coffee. I am a proud mom to a cat named Fia and I love her to the core even after she once broke my new laptop by biting the screen. I promise you’ll get to see a cute picture of Fia with every post of mine as a bonus.&lt;/p&gt;

&lt;p&gt;I also love reading books that gets me hooked with inspiring stories of successful women. I will also be using this platform to share some interesting insights I have gained from these stories.&lt;/p&gt;

&lt;p&gt;Subscribe and let’s be friends!&lt;/p&gt;

&lt;p&gt;Here’s me keeping my promise …&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkls1ksd0509dgk24eqqy.jpg" class="article-body-image-wrapper"&gt;&lt;img src="https://media.dev.to/cdn-cgi/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fkls1ksd0509dgk24eqqy.jpg" alt="my-cat" width="800" height="1066"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Subscribe to my newsletter here - &lt;a href="https://rakshakannusami.substack.com/"&gt;https://rakshakannusami.substack.com/&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;bye for now,&lt;/p&gt;

&lt;p&gt;Raksha &amp;amp; Fia&lt;/p&gt;

</description>
      <category>writing</category>
    </item>
    <item>
      <title>What is your favorite coffee?</title>
      <dc:creator>Raksha Kannusami </dc:creator>
      <pubDate>Tue, 06 Oct 2020 18:14:02 +0000</pubDate>
      <link>https://dev.to/rakshakannu/what-is-your-favorite-coffee-3bfl</link>
      <guid>https://dev.to/rakshakannu/what-is-your-favorite-coffee-3bfl</guid>
      <description>&lt;p&gt;Mine is freshly double brewed black coffee.&lt;br&gt;
Comment and share your favorite coffee.&lt;br&gt;
because there is no code without coffee :D&lt;/p&gt;

</description>
      <category>watercooler</category>
    </item>
    <item>
      <title>Subarray | Subsequence | Subset? - The difference.</title>
      <dc:creator>Raksha Kannusami </dc:creator>
      <pubDate>Tue, 22 Sep 2020 11:17:39 +0000</pubDate>
      <link>https://dev.to/rakshakannu/subarray-subsequence-subset-the-difference-doc</link>
      <guid>https://dev.to/rakshakannu/subarray-subsequence-subset-the-difference-doc</guid>
      <description>&lt;h1&gt;
  
  
  Have you come across these questions while practising to code?
&lt;/h1&gt;

&lt;p&gt;❓ Given an array of integers that might contain duplicates, return all possible &lt;strong&gt;subsets&lt;/strong&gt;.&lt;br&gt;
&lt;a href="https://practice.geeksforgeeks.org/problems/subsets/0"&gt;Try the Question here&lt;/a&gt; ⬅️&lt;/p&gt;

&lt;p&gt;❓ Given two sequences, find the length of the longest &lt;strong&gt;subsequence&lt;/strong&gt; present in both of them. Both the strings are of uppercase.&lt;br&gt;
&lt;a href="https://practice.geeksforgeeks.org/problems/longest-common-subsequence/0"&gt;Try the Question here&lt;/a&gt; ⬅️&lt;/p&gt;

&lt;p&gt;❓ Find out the maximum &lt;strong&gt;sub-array&lt;/strong&gt; of non-negative numbers from an array.&lt;br&gt;
&lt;a href="https://practice.geeksforgeeks.org/problems/maximum-sub-array5443/1"&gt;Try the Question here&lt;/a&gt; ⬅️&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;&lt;em&gt;If you want to attempt these questions, you should know the difference between Subset, Subsequence, and Subarray.&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Let us understand these 3 terms using a simple example.&lt;/p&gt;

&lt;p&gt;Suppose we are given an array of numbers, &lt;strong&gt;{10,20,30,40,50}&lt;/strong&gt;, we need to find: Subset, subsequence, and subarray.&lt;/p&gt;

&lt;h1&gt;
  
  
  Subarray:
&lt;/h1&gt;

&lt;p&gt;A subarray is a contiguous sequence in an array.&lt;/p&gt;

&lt;p&gt;{10,20,30} ✅&lt;br&gt;
{10,20} ✅&lt;br&gt;
{10,30} ❌&lt;/p&gt;

&lt;h1&gt;
  
  
  Subsequence:
&lt;/h1&gt;

&lt;p&gt;A subsequence is a set of elements not necessarily contiguous but should maintain order.&lt;/p&gt;

&lt;p&gt;{10,20,30} ✅&lt;br&gt;
{10,30} ✅&lt;br&gt;
{10,40,30} ❌&lt;/p&gt;

&lt;h1&gt;
  
  
  Subset:
&lt;/h1&gt;

&lt;p&gt;A subset is a subsequence, except it also includes an empty set {}.&lt;/p&gt;

&lt;p&gt;{10,20,30} ✅&lt;br&gt;
{10,40} ✅&lt;br&gt;
{} ✅&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;FACT: All subsets are subsequences, and all subsequences are subsets!&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Now you'll never confuse these terms!&lt;/p&gt;

&lt;p&gt;Keep learning! Keep growing! 💖&lt;/p&gt;

</description>
      <category>100daysofcode</category>
      <category>java</category>
      <category>codequality</category>
    </item>
    <item>
      <title>Thank you DEV! 💖</title>
      <dc:creator>Raksha Kannusami </dc:creator>
      <pubDate>Tue, 15 Sep 2020 13:55:11 +0000</pubDate>
      <link>https://dev.to/rakshakannu/thank-you-dev-180n</link>
      <guid>https://dev.to/rakshakannu/thank-you-dev-180n</guid>
      <description>&lt;p&gt;I'm grateful for this community.&lt;br&gt;
I'm grateful to you people who encourage me.&lt;br&gt;
I'm grateful for all my friends who correct me.&lt;/p&gt;
&lt;h1&gt;
  
  
  I'm grateful for you who is reading this. ❤️
&lt;/h1&gt;

&lt;p&gt;I wrote my first article on DEV on May 28, 2020, and in a span of 130 days I published 17 posts with 17K+ views, 1000 followers, and a &lt;strong&gt;whole lot of learning!&lt;/strong&gt; 🎉&lt;/p&gt;

&lt;p&gt;&lt;a href="https://i.giphy.com/media/3o6nUQqlowTVIkz5XW/giphy.gif" class="article-body-image-wrapper"&gt;&lt;img src="https://i.giphy.com/media/3o6nUQqlowTVIkz5XW/giphy.gif" alt="Thank you"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Writing on this platform gave me an immense amount of learning, which I couldn't have got without DEV. Every topic I wrote about, helped me understand it deeply enough that would never forget about it. &lt;/p&gt;

&lt;p&gt;I consider this just the beginning for me to get better at writing, learning more, and moreover helping people with the knowledge that I am gaining, one post at a time. 😊&lt;/p&gt;

&lt;p&gt;I wish to learn more,&lt;br&gt;
share more,&lt;br&gt;
write more,&lt;br&gt;
grow more. &lt;/p&gt;

&lt;p&gt;Thank you again.&lt;/p&gt;

&lt;p&gt;Do check out one of my posts which was most liked by you guys!😁&lt;/p&gt;


&lt;div class="ltag__link"&gt;
  &lt;a href="/rakshakannu" class="ltag__link__link"&gt;
    &lt;div class="ltag__link__pic"&gt;
      &lt;img src="https://media.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F274024%2F35d4cda2-25bb-4247-b99f-52d726b9acf1.jpg" alt="rakshakannu"&gt;
    &lt;/div&gt;
  &lt;/a&gt;
  &lt;a href="/rakshakannu/productivity-are-you-a-fox-or-a-hedgehog-3i72" class="ltag__link__link"&gt;
    &lt;div class="ltag__link__content"&gt;
      &lt;h2&gt;Productivity: Are you a fox 🦊 or a hedgehog 🦔?&lt;/h2&gt;
      &lt;h3&gt;Raksha Kannusami  ・ Aug 11 '20&lt;/h3&gt;
      &lt;div class="ltag__link__taglist"&gt;
        &lt;span class="ltag__link__tag"&gt;#productivity&lt;/span&gt;
      &lt;/div&gt;
    &lt;/div&gt;
  &lt;/a&gt;
&lt;/div&gt;


&lt;p&gt;keep learning, keep coding, keep growing! 💖&lt;/p&gt;

</description>
      <category>watercooler</category>
    </item>
    <item>
      <title>⭐ this GitHub repository for Array pseudo-codes! 🎉</title>
      <dc:creator>Raksha Kannusami </dc:creator>
      <pubDate>Tue, 08 Sep 2020 12:28:45 +0000</pubDate>
      <link>https://dev.to/rakshakannu/array-pseudo-codes-2071</link>
      <guid>https://dev.to/rakshakannu/array-pseudo-codes-2071</guid>
      <description>&lt;p&gt;I have been learning data structures and algorithms for a while and have been learning using various resources online.&lt;/p&gt;

&lt;p&gt;I started with the simplest data-structure, &lt;strong&gt;Arrays&lt;/strong&gt;.&lt;/p&gt;

&lt;p&gt;As a part of this, I maintained a &lt;strong&gt;Github repository&lt;/strong&gt; to save all the pseudo-codes so that it becomes easy for future reference.&lt;/p&gt;


&lt;div class="ltag-github-readme-tag"&gt;
  &lt;div class="readme-overview"&gt;
    &lt;h2&gt;
      &lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--566lAguM--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev.to/assets/github-logo-5a155e1f9a670af7944dd5e12375bc76ed542ea80224905ecaf878b9157cdefc.svg" alt="GitHub logo"&gt;
      &lt;a href="https://github.com/rakshakannu"&gt;
        rakshakannu
      &lt;/a&gt; / &lt;a href="https://github.com/rakshakannu/Datastructures-arrays"&gt;
        Datastructures-arrays
      &lt;/a&gt;
    &lt;/h2&gt;
    &lt;h3&gt;
      collection of various problems and solutions on array data structure.
    &lt;/h3&gt;
  &lt;/div&gt;
  &lt;div class="ltag-github-body"&gt;
    
&lt;div id="readme" class="md"&gt;
&lt;h1&gt;
Datastructures-java-arrays&lt;/h1&gt;
&lt;p&gt;logic of various problems in arrays.&lt;/p&gt;
&lt;/div&gt;



&lt;/div&gt;
&lt;br&gt;
  &lt;div class="gh-btn-container"&gt;&lt;a class="gh-btn" href="https://github.com/rakshakannu/Datastructures-arrays"&gt;View on GitHub&lt;/a&gt;&lt;/div&gt;
&lt;br&gt;
&lt;/div&gt;
&lt;br&gt;


&lt;p&gt;Most of the code is in JAVA, but since they are pseudo-codes, you shouldn’t have any difficulties understanding it even if you are using other languages. 😊&lt;/p&gt;

&lt;p&gt;If you are learning Datastructures and algorithms, you can &lt;strong&gt;star ⭐️ or fork&lt;/strong&gt; this repository, I'm sure it will help you in the &lt;strong&gt;&lt;em&gt;last minute revision!&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;Since there are a lot of people preparing I thought sharing this will help many aspirants like me who are preparing for interviews or want to improve their DSA skills!&lt;/p&gt;

&lt;p&gt;Will be sharing more, as and when I progress.&lt;/p&gt;

&lt;p&gt;Keep coding! keep learning! keep growing! 💖&lt;/p&gt;

</description>
      <category>java</category>
      <category>datastructures</category>
      <category>algorithms</category>
      <category>github</category>
    </item>
    <item>
      <title>Java: 4 ways to create a String! 💡</title>
      <dc:creator>Raksha Kannusami </dc:creator>
      <pubDate>Tue, 01 Sep 2020 13:28:01 +0000</pubDate>
      <link>https://dev.to/rakshakannu/java-4-ways-to-create-a-string-1i0o</link>
      <guid>https://dev.to/rakshakannu/java-4-ways-to-create-a-string-1i0o</guid>
      <description>&lt;h1&gt;
  
  
  The String Datatype:
&lt;/h1&gt;

&lt;p&gt;A string is nothing but a collection of characters. In java, Strings are &lt;strong&gt;immutable&lt;/strong&gt;. Immutable simply means unmodifiable or unchangeable. Once a string object is created its data or state can't be changed but a new string object is created.&lt;/p&gt;

&lt;h1&gt;
  
  
  You can create a String using 4 ways in Java:
&lt;/h1&gt;

&lt;h1&gt;
  
  
  1. Using a character array
&lt;/h1&gt;

&lt;p&gt;Character Array is a sequential collection of data type char.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;char&lt;/span&gt;&lt;span class="o"&gt;[]&lt;/span&gt; &lt;span class="n"&gt;array&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="o"&gt;{&lt;/span&gt;&lt;span class="sc"&gt;'s'&lt;/span&gt;&lt;span class="o"&gt;,&lt;/span&gt;&lt;span class="sc"&gt;'t'&lt;/span&gt;&lt;span class="o"&gt;,&lt;/span&gt;&lt;span class="sc"&gt;'r'&lt;/span&gt;&lt;span class="o"&gt;,&lt;/span&gt;&lt;span class="sc"&gt;'i'&lt;/span&gt;&lt;span class="o"&gt;,&lt;/span&gt;&lt;span class="sc"&gt;'n'&lt;/span&gt;&lt;span class="o"&gt;,&lt;/span&gt;&lt;span class="sc"&gt;'g'&lt;/span&gt;&lt;span class="o"&gt;};&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h1&gt;
  
  
  2. Using String class
&lt;/h1&gt;

&lt;p&gt;The String class represents character strings. All string literals in Java programs, such as "abc", are implemented as instances of this class. Strings are constant; their values cannot be changed after they are created. String buffers support mutable strings. Because String objects are immutable they can be shared.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="nc"&gt;String&lt;/span&gt; &lt;span class="n"&gt;str&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="s"&gt;"string"&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h1&gt;
  
  
  3. Using StringBuffer
&lt;/h1&gt;

&lt;p&gt;A thread-safe, mutable sequence of characters. A string buffer is like a String, but can be modified. At any point in time it contains some particular sequence of characters, but the length and content of the sequence can be changed through certain method calls.&lt;br&gt;
String buffers are safe for use by multiple threads. The methods are synchronized where necessary so that all the operations on any particular instance behave as if they occur in some serial order that is consistent with the order of the method calls made by each of the individual threads involved.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="nc"&gt;StringBuffer&lt;/span&gt;  &lt;span class="n"&gt;str&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="nc"&gt;StringBuffer&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="s"&gt;"string"&lt;/span&gt;&lt;span class="o"&gt;);&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h1&gt;
  
  
  4. Using StringBuilder
&lt;/h1&gt;

&lt;p&gt;A mutable sequence of characters. This class provides an API compatible with StringBuffer, but with no guarantee of synchronization. This class is designed for use as a drop-in replacement for StringBuffer in places where the string buffer was being used by a single thread (as is generally the case). Where possible, it is recommended that this class be used in preference to StringBuffer as it will be faster under most implementations.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="nc"&gt;StringBuilder&lt;/span&gt; &lt;span class="n"&gt;str&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="nc"&gt;StringBuilder&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="s"&gt;"string"&lt;/span&gt;&lt;span class="o"&gt;);&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Now you know how to create a String, In the upcoming article I will be covering all the String methods that can be used to format Strings.&lt;/p&gt;

&lt;p&gt;... To be continued 🎉&lt;br&gt;
keep learning, keep growing 💖&lt;/p&gt;

</description>
      <category>java</category>
      <category>tutorial</category>
    </item>
    <item>
      <title>Java: Recursion Basics. 🔁</title>
      <dc:creator>Raksha Kannusami </dc:creator>
      <pubDate>Tue, 25 Aug 2020 10:16:15 +0000</pubDate>
      <link>https://dev.to/rakshakannu/java-recursion-basics-1ple</link>
      <guid>https://dev.to/rakshakannu/java-recursion-basics-1ple</guid>
      <description>&lt;h1&gt;
  
  
  What is recursion?
&lt;/h1&gt;

&lt;p&gt;Recursion is a way to write a program where the function calls itself. A function is called recursive if it calls itself directly or indirectly. &lt;/p&gt;

&lt;p&gt;When a function calls itself directly:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;void&lt;/span&gt; &lt;span class="nf"&gt;function1&lt;/span&gt;&lt;span class="o"&gt;(){&lt;/span&gt;
    &lt;span class="o"&gt;.&lt;/span&gt;
    &lt;span class="o"&gt;.&lt;/span&gt; 
    &lt;span class="n"&gt;function1&lt;/span&gt;&lt;span class="o"&gt;();&lt;/span&gt;
&lt;span class="o"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;When a function calls itself indirectly:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;void&lt;/span&gt; &lt;span class="nf"&gt;function1&lt;/span&gt;&lt;span class="o"&gt;(){&lt;/span&gt;
    &lt;span class="o"&gt;.&lt;/span&gt;
    &lt;span class="o"&gt;.&lt;/span&gt;
    &lt;span class="n"&gt;function2&lt;/span&gt;&lt;span class="o"&gt;();&lt;/span&gt;
&lt;span class="o"&gt;}&lt;/span&gt;

&lt;span class="kt"&gt;void&lt;/span&gt; &lt;span class="nf"&gt;function2&lt;/span&gt;&lt;span class="o"&gt;(){&lt;/span&gt;
    &lt;span class="o"&gt;.&lt;/span&gt;
    &lt;span class="o"&gt;.&lt;/span&gt;
    &lt;span class="n"&gt;function1&lt;/span&gt;&lt;span class="o"&gt;();&lt;/span&gt;
&lt;span class="o"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h1&gt;
  
  
  Applications of recursion:
&lt;/h1&gt;

&lt;p&gt;🎯 Dynamic programming&lt;br&gt;
🎯 Backtracking&lt;br&gt;
🎯 Searching algorithms like Binary search&lt;br&gt;
🎯 Sorting algorithms like merge sort and quick sort&lt;br&gt;
🎯 Tree traversals ... etc.&lt;/p&gt;

&lt;h1&gt;
  
  
  Is recursion better than iteration?
&lt;/h1&gt;

&lt;p&gt;Even though recursion might look like its better than iteration since the length of the code is less, it is the iteration that is always efficient when it comes to the time complexity of the code. This is because, when recursive code is being compiled, the number of arguments in the function call stack increases and this increases the time complexity of the code.&lt;/p&gt;

&lt;h1&gt;
  
  
  Printing 1 to N using Recursion
&lt;/h1&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kd"&gt;class&lt;/span&gt; &lt;span class="nc"&gt;Test&lt;/span&gt;&lt;span class="o"&gt;{&lt;/span&gt;
  &lt;span class="kd"&gt;static&lt;/span&gt; &lt;span class="kt"&gt;void&lt;/span&gt; &lt;span class="nf"&gt;print1toN&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;)&lt;/span&gt;
  &lt;span class="o"&gt;{&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;==&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="o"&gt;)&lt;/span&gt;
      &lt;span class="k"&gt;return&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
    &lt;span class="n"&gt;print1toN&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="o"&gt;);&lt;/span&gt;
    &lt;span class="nc"&gt;System&lt;/span&gt;&lt;span class="o"&gt;.&lt;/span&gt;&lt;span class="na"&gt;out&lt;/span&gt;&lt;span class="o"&gt;.&lt;/span&gt;&lt;span class="na"&gt;print&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;+&lt;/span&gt;&lt;span class="s"&gt;" "&lt;/span&gt;&lt;span class="o"&gt;);&lt;/span&gt;
&lt;span class="o"&gt;}&lt;/span&gt;

&lt;span class="kd"&gt;public&lt;/span&gt; &lt;span class="kd"&gt;static&lt;/span&gt; &lt;span class="kt"&gt;void&lt;/span&gt; &lt;span class="nf"&gt;main&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="nc"&gt;String&lt;/span&gt;&lt;span class="o"&gt;[]&lt;/span&gt; &lt;span class="n"&gt;args&lt;/span&gt;&lt;span class="o"&gt;)&lt;/span&gt;
&lt;span class="o"&gt;{&lt;/span&gt;
  &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mi"&gt;10&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
  &lt;span class="n"&gt;print1toN&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;);&lt;/span&gt;
&lt;span class="o"&gt;}&lt;/span&gt;
&lt;span class="o"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h1&gt;
  
  
  Printing N to 1 using Recursion
&lt;/h1&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kd"&gt;class&lt;/span&gt; &lt;span class="nc"&gt;test&lt;/span&gt;&lt;span class="o"&gt;{&lt;/span&gt;
  &lt;span class="kd"&gt;static&lt;/span&gt; &lt;span class="kt"&gt;void&lt;/span&gt; &lt;span class="nf"&gt;printNto1&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;)&lt;/span&gt;
  &lt;span class="o"&gt;{&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;==&lt;/span&gt;&lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="o"&gt;)&lt;/span&gt;
      &lt;span class="k"&gt;return&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;

    &lt;span class="nc"&gt;System&lt;/span&gt;&lt;span class="o"&gt;.&lt;/span&gt;&lt;span class="na"&gt;out&lt;/span&gt;&lt;span class="o"&gt;.&lt;/span&gt;&lt;span class="na"&gt;print&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;+&lt;/span&gt;&lt;span class="s"&gt;" "&lt;/span&gt;&lt;span class="o"&gt;);&lt;/span&gt;
    &lt;span class="n"&gt;printNto1&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="o"&gt;);&lt;/span&gt;
  &lt;span class="o"&gt;}&lt;/span&gt;
&lt;span class="o"&gt;}&lt;/span&gt;

&lt;span class="kd"&gt;public&lt;/span&gt; &lt;span class="kd"&gt;static&lt;/span&gt; &lt;span class="kt"&gt;void&lt;/span&gt; &lt;span class="nf"&gt;main&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="nc"&gt;String&lt;/span&gt; &lt;span class="n"&gt;args&lt;/span&gt;&lt;span class="o"&gt;[])&lt;/span&gt;
&lt;span class="o"&gt;{&lt;/span&gt;
  &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mi"&gt;10&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
  &lt;span class="nc"&gt;PrintNto1&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;);&lt;/span&gt;
&lt;span class="o"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h1&gt;
  
  
  Some Recursive problems to explore:
&lt;/h1&gt;

&lt;h1&gt;
  
  
  Basic Problems:
&lt;/h1&gt;

&lt;ol&gt;
&lt;li&gt;Fibonacci series using recursion&lt;/li&gt;
&lt;li&gt;Sum of natural numbers using recursion&lt;/li&gt;
&lt;li&gt;Palindrome check using recursion&lt;/li&gt;
&lt;li&gt;Sum of digits using recursion&lt;/li&gt;
&lt;/ol&gt;

&lt;h1&gt;
  
  
  Advanced Problems:
&lt;/h1&gt;

&lt;ol&gt;
&lt;li&gt;Tower of Hanoi&lt;/li&gt;
&lt;li&gt;Rod cutting problem&lt;/li&gt;
&lt;li&gt;Josephus problem&lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;To get good at recursion, practice is the key. After a significant amount of practice, you'll easily recognize the questions that you can solve using recursion! &lt;/p&gt;

&lt;p&gt;To start off, you can practice the above-listed problems on &lt;a href="https://www.geeksforgeeks.org/"&gt;GeeksforGeeks&lt;/a&gt; or &lt;a href="https://leetcode.com/"&gt;Leetcode&lt;/a&gt;. 👩🏻‍💻&lt;/p&gt;

&lt;p&gt;... to be continued 🎉&lt;/p&gt;

&lt;p&gt;keep learning, keep coding! 🌸&lt;/p&gt;

</description>
      <category>java</category>
      <category>tutorial</category>
    </item>
    <item>
      <title>Java: Wrapper Class ⭐️</title>
      <dc:creator>Raksha Kannusami </dc:creator>
      <pubDate>Tue, 18 Aug 2020 17:20:54 +0000</pubDate>
      <link>https://dev.to/rakshakannu/java-wrapper-class-4nof</link>
      <guid>https://dev.to/rakshakannu/java-wrapper-class-4nof</guid>
      <description>&lt;h1&gt;
  
  
  🔰 what is a wrapper class in Java?
&lt;/h1&gt;

&lt;p&gt;A Wrapper class is a class whose object wraps or contains primitive data types. When we create an object to a wrapper class, it contains a field and in this field, we can store primitive data types. In other words, we can wrap a primitive value into a wrapper class object.&lt;/p&gt;

&lt;h1&gt;
  
  
  🔰 Why do we need a Wrapper class?
&lt;/h1&gt;

&lt;ol&gt;
&lt;li&gt;&lt;p&gt;They convert primitive data types into objects. Objects are needed if we wish to modify the arguments passed into a method (because primitive types are passed by value).&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;The classes in java.util package handles only objects and hence wrapper classes help in this case also.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;Data structures in the Collection framework, such as ArrayList and Vector, store only objects (reference types) and not primitive types.&lt;/p&gt;&lt;/li&gt;
&lt;li&gt;&lt;p&gt;An object is needed to support synchronization in multithreading.&lt;/p&gt;&lt;/li&gt;
&lt;/ol&gt;

&lt;h1&gt;
  
  
  🔰 How to create a wrapper class for primitive data types?
&lt;/h1&gt;



&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="c1"&gt;// primitive data type - Wrapper Class&lt;/span&gt;
   &lt;span class="kt"&gt;char&lt;/span&gt;                &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="nc"&gt;Character&lt;/span&gt;
   &lt;span class="kt"&gt;byte&lt;/span&gt;                &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="nc"&gt;Byte&lt;/span&gt;
   &lt;span class="kt"&gt;short&lt;/span&gt;               &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="nc"&gt;Short&lt;/span&gt;
   &lt;span class="kt"&gt;int&lt;/span&gt;                 &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="nc"&gt;Integer&lt;/span&gt;
   &lt;span class="kt"&gt;long&lt;/span&gt;                &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="nc"&gt;Long&lt;/span&gt;
   &lt;span class="kt"&gt;float&lt;/span&gt;               &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="nc"&gt;Float&lt;/span&gt;
   &lt;span class="kt"&gt;double&lt;/span&gt;              &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="nc"&gt;Double&lt;/span&gt;
   &lt;span class="kt"&gt;boolean&lt;/span&gt;             &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="nc"&gt;Boolean&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h1&gt;
  
  
  How to create a Wrapper class?
&lt;/h1&gt;

&lt;p&gt;Let us see an example of how to create a wrapper class below.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kd"&gt;class&lt;/span&gt; &lt;span class="nc"&gt;autoBoxing&lt;/span&gt;&lt;span class="o"&gt;{&lt;/span&gt;
  &lt;span class="kd"&gt;public&lt;/span&gt; &lt;span class="kd"&gt;static&lt;/span&gt; &lt;span class="kt"&gt;void&lt;/span&gt; &lt;span class="nf"&gt;main&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="nc"&gt;String&lt;/span&gt;&lt;span class="o"&gt;[]&lt;/span&gt; &lt;span class="n"&gt;args&lt;/span&gt;&lt;span class="o"&gt;){&lt;/span&gt;
    &lt;span class="kt"&gt;char&lt;/span&gt; &lt;span class="n"&gt;ch&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="sc"&gt;'a'&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;

    &lt;span class="c1"&gt;//converting primitive data type into an object (autoboxing)&lt;/span&gt;
    &lt;span class="nc"&gt;Character&lt;/span&gt; &lt;span class="n"&gt;a&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;ch&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
  &lt;span class="o"&gt;}&lt;/span&gt;
&lt;span class="o"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;The above process is also called as &lt;strong&gt;Autoboxing&lt;/strong&gt;.&lt;/p&gt;

&lt;h1&gt;
  
  
  🔰 Autoboxing:
&lt;/h1&gt;

&lt;p&gt;Autoboxing is the automatic conversion that the Java compiler makes between the primitive types and their corresponding object wrapper classes. For example, converting an int to an Integer, a double to a Double, and so on. If the conversion goes the other way, this is called unboxing.&lt;/p&gt;

&lt;p&gt;...To be continued. 🎉&lt;/p&gt;

&lt;p&gt;keep learning, Keep coding. 💖&lt;/p&gt;

</description>
      <category>java</category>
      <category>tutorial</category>
    </item>
    <item>
      <title>Productivity: Are you a fox 🦊 or a hedgehog 🦔?</title>
      <dc:creator>Raksha Kannusami </dc:creator>
      <pubDate>Tue, 11 Aug 2020 16:24:26 +0000</pubDate>
      <link>https://dev.to/rakshakannu/productivity-are-you-a-fox-or-a-hedgehog-3i72</link>
      <guid>https://dev.to/rakshakannu/productivity-are-you-a-fox-or-a-hedgehog-3i72</guid>
      <description>&lt;h1&gt;
  
  
  Disclaimer:
&lt;/h1&gt;

&lt;p&gt;This is a short story that I came across that really intrigued me and want to share it with you all. By the end of this article, I encourage you all to get insights from this post, that will help you with your coding journey.&lt;/p&gt;

&lt;h1&gt;
  
  
  Ask yourself:
&lt;/h1&gt;

&lt;p&gt;before we dive into the story, ask this question to yourself.&lt;br&gt;
If you were given a chance to be a fox 🦊 or hedgehog 🦔, which one would you chose?&lt;/p&gt;

&lt;p&gt;Obviously the FOX! 🦊&lt;br&gt;
Fox is so beautiful, sleek, and cunning. On the other hand, Hedgehogs are slow, timid, and not so interesting. &lt;/p&gt;

&lt;h1&gt;
  
  
  Read this story:
&lt;/h1&gt;

&lt;p&gt;The fox is a cunning creature, able to devise a myriad of complex strategies for sneak attacks upon the hedgehog. Every day, the fox circles around the hedgehog’s den, waiting for the perfect moment to pounce. Fast and crafty—the fox looks like the sure winner. The hedgehog, on the other hand, waddles along, going about his simple day, searching for lunch, and taking care of his home.&lt;/p&gt;

&lt;p&gt;The fox waits in cunning silence at the juncture in the trail. The hedgehog, minding his own business, wanders right into the path of the fox. &lt;em&gt;“Aha, I’ve got you now!”&lt;/em&gt; thinks the fox. He leaps out, bounding across the ground, lightning-fast. The little hedgehog, sensing danger, looks up and thinks, &lt;em&gt;“Here we go again. Will, he ever learn?”&lt;/em&gt; Rolling up into a perfect little ball, the hedgehog becomes a sphere of sharp spikes, pointing outward in all directions.&lt;/p&gt;

&lt;p&gt;The fox, bounding toward his prey, sees the hedgehog defense and calls off the attack. Retreating back to the forest, the fox begins to calculate a new line of attack. Each day, some version of this battle between the hedgehog and the fox takes place, and despite the greater cunning of the fox, the hedgehog always wins. &lt;/p&gt;

&lt;h1&gt;
  
  
  Moral:
&lt;/h1&gt;

&lt;h1&gt;
  
  
  🦊 The FOX
&lt;/h1&gt;

&lt;p&gt;Foxes pursue many ends at the same time and see the world in all its complexity. They are scattered or diffused, moving on many levels never integrating their thinking into one overall concept or unifying vision. &lt;/p&gt;

&lt;h1&gt;
  
  
  🦔 The Hedgehog
&lt;/h1&gt;

&lt;p&gt;Hedgehogs, on the other hand, simplify a complex world into a single organizing idea, a basic principle or concept that unifies and guides everything. It doesn’t matter how complex the world, a hedgehog reduces all challenges and dilemmas to simple—indeed almost simplistic— hedgehog ideas. For a hedgehog, anything that does not somehow relate to the hedgehog idea holds no relevance.&lt;/p&gt;

&lt;h1&gt;
  
  
  Ask yourself again.
&lt;/h1&gt;

&lt;p&gt;Am I a fox 🦊 or a hedgehog 🦔 ?&lt;br&gt;
My thoughts are fox-like or hedgehog-like?&lt;/p&gt;

&lt;h1&gt;
  
  
  Conclusion:
&lt;/h1&gt;

&lt;p&gt;The hedgehog, despite the fox's cleverness, does &lt;strong&gt;one thing&lt;/strong&gt; imperially well — it knows how to defend itself. If a hedgehog and fox were to compete, the hedgehog would be the fairer. But taken figuratively, hedgehog thinking draws from a central vision and foxes search for seemingly unrelated or even contradictory pursuits. The origin of the "fox or hedgehog" concept is unclear, and interpretations have changed over the years. &lt;/p&gt;

&lt;p&gt;Princeton professor Marvin Bressler pointed out the power of the hedgehog and said: &lt;strong&gt;&lt;em&gt;“You want to know what separates those who make the biggest impact from all the others who are just as smart? They’re hedgehogs.”&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;

&lt;h1&gt;
  
  
  The take-backs:
&lt;/h1&gt;

&lt;blockquote&gt;
&lt;p&gt;Don't try to do a lot of things at once.&lt;br&gt;
Don't get distracted.&lt;br&gt;
Be the master of one, rather than a jack of all trades.&lt;br&gt;
Don't compare yourself.&lt;/p&gt;
&lt;/blockquote&gt;

&lt;h1&gt;
  
  
  Are you ready to be a hedgehog, mark your goals, and smash them?
&lt;/h1&gt;

&lt;p&gt;keep learning, keep coding, keep growing. 🌸&lt;/p&gt;

</description>
      <category>productivity</category>
    </item>
    <item>
      <title>#100DaysOfCode challenge!</title>
      <dc:creator>Raksha Kannusami </dc:creator>
      <pubDate>Tue, 04 Aug 2020 04:07:10 +0000</pubDate>
      <link>https://dev.to/rakshakannu/100daysofcode-challenge-2a07</link>
      <guid>https://dev.to/rakshakannu/100daysofcode-challenge-2a07</guid>
      <description>&lt;h1&gt;
  
  
  🧐 what is the #100DaysOfCode challenge?
&lt;/h1&gt;

&lt;p&gt;It is a challenge that you take up for the next 100 days where you follow the 2 simple rules below.&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Code for a minimum of one hour a day.&lt;/li&gt;
&lt;li&gt;Tweet your progress with the hashtag #100DaysofCode.&lt;/li&gt;
&lt;/ol&gt;

&lt;h1&gt;
  
  
  🤔 Who can take up this challenge?
&lt;/h1&gt;

&lt;p&gt;To be short and precise, anyone who wants to learn to code/ improve their coding skills. In this challenge, you may learn any programming language, work on a project, or even read books and code. The only thing to be kept in mind is that, make sure you are learning and gaining something every day for the next 100 days.&lt;/p&gt;

&lt;h1&gt;
  
  
  ❓ Why did I take up this challenge?
&lt;/h1&gt;

&lt;p&gt;I started studying Datastructures and Algorithms 2 months back but eventually lost my motivation. I wanted something that would give me the push every day to sit and learn. &lt;/p&gt;

&lt;h1&gt;
  
  
  👨🏻‍💻 Why tweet your progress?
&lt;/h1&gt;

&lt;p&gt;Twitter has an amazing community for software developers just like the DEV community. People are friendly and welcoming and you can easily find like-minded people.&lt;/p&gt;


&lt;blockquote class="ltag__twitter-tweet"&gt;

  &lt;div class="ltag__twitter-tweet__main"&gt;
    &lt;div class="ltag__twitter-tweet__header"&gt;
      &lt;img class="ltag__twitter-tweet__profile-image" src="https://res.cloudinary.com/practicaldev/image/fetch/s--oiPiK1p_--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://pbs.twimg.com/profile_images/1258344570196242433/N4UlBB4B_normal.jpg" alt="Raksha Kannusami profile image"&gt;
      &lt;div class="ltag__twitter-tweet__full-name"&gt;
        Raksha Kannusami
      &lt;/div&gt;
      &lt;div class="ltag__twitter-tweet__username"&gt;
        @kannusamiraksha
      &lt;/div&gt;
      &lt;div class="ltag__twitter-tweet__twitter-logo"&gt;
        &lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--ir1kO05j--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev.to/assets/twitter-f95605061196010f91e64806688390eb1a4dbc9e913682e043eb8b1e06ca484f.svg" alt="twitter logo"&gt;
      &lt;/div&gt;
    &lt;/div&gt;
    &lt;div class="ltag__twitter-tweet__body"&gt;
      I'm officially starting with &lt;a href="https://twitter.com/hashtag/100DaysOfCode"&gt;#100DaysOfCode&lt;/a&gt;. My main aim in the upcoming 100 days will be to learn DSA! Wish me luck! 🌻
    &lt;/div&gt;
    &lt;div class="ltag__twitter-tweet__date"&gt;
      03:49 AM - 31 Jul 2020
    &lt;/div&gt;


    &lt;div class="ltag__twitter-tweet__actions"&gt;
      &lt;a href="https://twitter.com/intent/tweet?in_reply_to=1289045404567261187" class="ltag__twitter-tweet__actions__button"&gt;
        &lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--fFnoeFxk--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev.to/assets/twitter-reply-action-238fe0a37991706a6880ed13941c3efd6b371e4aefe288fe8e0db85250708bc4.svg" alt="Twitter reply action"&gt;
      &lt;/a&gt;
      &lt;a href="https://twitter.com/intent/retweet?tweet_id=1289045404567261187" class="ltag__twitter-tweet__actions__button"&gt;
        &lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--k6dcrOn8--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev.to/assets/twitter-retweet-action-632c83532a4e7de573c5c08dbb090ee18b348b13e2793175fea914827bc42046.svg" alt="Twitter retweet action"&gt;
      &lt;/a&gt;
      &lt;a href="https://twitter.com/intent/like?tweet_id=1289045404567261187" class="ltag__twitter-tweet__actions__button"&gt;
        &lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--SRQc9lOp--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev.to/assets/twitter-like-action-1ea89f4b87c7d37465b0eb78d51fcb7fe6c03a089805d7ea014ba71365be5171.svg" alt="Twitter like action"&gt;
      &lt;/a&gt;
    &lt;/div&gt;
  &lt;/div&gt;
&lt;/blockquote&gt;


&lt;p&gt;It's been four days since I started this challenge and have had great encouragement from the community. Hope to come back after 100 days and update you all about my learnings from those 100 days. Wish me luck. 🤞🏽&lt;/p&gt;

&lt;h1&gt;
  
  
  🔰 Know more about the challenge:
&lt;/h1&gt;

&lt;p&gt;You can learn more about the challenge from the &lt;a href="https://www.100daysofcode.com/"&gt;official website&lt;/a&gt;.&lt;br&gt;
Keep learning! Keep coding! 💖&lt;/p&gt;

&lt;h1&gt;
  
  
  🎉 Update:
&lt;/h1&gt;

&lt;p&gt;I have completed the challenge successfully!&lt;br&gt;
Definitely was not easy to be consistent at the beginning, but eventually fell in love with the community support. &lt;/p&gt;

</description>
      <category>computerscience</category>
      <category>challenge</category>
      <category>java</category>
      <category>100daysofcode</category>
    </item>
    <item>
      <title>Java: Arrays!</title>
      <dc:creator>Raksha Kannusami </dc:creator>
      <pubDate>Tue, 28 Jul 2020 07:53:43 +0000</pubDate>
      <link>https://dev.to/rakshakannu/java-arrays-a65</link>
      <guid>https://dev.to/rakshakannu/java-arrays-a65</guid>
      <description>&lt;p&gt;Most interviews for an SDE (software development engineer) role require you to have a good grasp of Data structures and algorithms.&lt;/p&gt;

&lt;p&gt;One important data structure is Arrays.&lt;/p&gt;

&lt;p&gt;An array is a linear data structure and is famous for storing values at contiguous memory locations.&lt;/p&gt;

&lt;p&gt;This article will help you to get started with arrays. 🥳&lt;/p&gt;

&lt;p&gt;I will be using Java, but don't worry, you should be able to understand these pseudo-codes irrespective of programming language.&lt;/p&gt;

&lt;p&gt;Let us understand the basic manipulation on arrays like insert, delete, sort, etc.&lt;/p&gt;

&lt;h1&gt;
  
  
  1. Create an array.
&lt;/h1&gt;

&lt;p&gt;To create an integer array of size 100,&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;int&lt;/span&gt;&lt;span class="o"&gt;[]&lt;/span&gt; &lt;span class="n"&gt;array&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="kt"&gt;int&lt;/span&gt;&lt;span class="o"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;100&lt;/span&gt;&lt;span class="o"&gt;];&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h1&gt;
  
  
  2. Insert an element into an array.
&lt;/h1&gt;

&lt;p&gt;The following function will insert any element at any position specified by the user and will return the size of the modified array after insertion.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="nf"&gt;insert&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;array&lt;/span&gt;&lt;span class="o"&gt;[],&lt;/span&gt; &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;,&lt;/span&gt; &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="o"&gt;,&lt;/span&gt; &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;capacity&lt;/span&gt;&lt;span class="o"&gt;,&lt;/span&gt; &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;position&lt;/span&gt;&lt;span class="o"&gt;)&lt;/span&gt;
&lt;span class="o"&gt;{&lt;/span&gt;
  &lt;span class="k"&gt;if&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;==&lt;/span&gt;&lt;span class="n"&gt;capacity&lt;/span&gt;&lt;span class="o"&gt;)&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt; &lt;span class="c1"&gt;//cannot insert any element since exceeding capacity&lt;/span&gt;
  &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;index&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="n"&gt;position&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
  &lt;span class="k"&gt;for&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="kt"&gt;int&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;n&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="o"&gt;&amp;gt;=&lt;/span&gt;&lt;span class="n"&gt;index&lt;/span&gt;&lt;span class="o"&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;array&lt;/span&gt;&lt;span class="o"&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="o"&gt;]=&lt;/span&gt;&lt;span class="n"&gt;array&lt;/span&gt;&lt;span class="o"&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;array&lt;/span&gt;&lt;span class="o"&gt;[&lt;/span&gt;&lt;span class="n"&gt;index&lt;/span&gt;&lt;span class="o"&gt;]=&lt;/span&gt;&lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
  &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;+&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="o"&gt;);&lt;/span&gt; &lt;span class="c1"&gt;//returns the size of the new array.&lt;/span&gt;
&lt;span class="o"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h1&gt;
  
  
  3. Delete an element from an array.
&lt;/h1&gt;

&lt;p&gt;The following function will delete any element at the position specified by the user and will return the size of the modified array after deletion.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="nf"&gt;delete&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;array&lt;/span&gt;&lt;span class="o"&gt;[],&lt;/span&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;,&lt;/span&gt; &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="o"&gt;)&lt;/span&gt;
&lt;span class="o"&gt;{&lt;/span&gt;
  &lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
  &lt;span class="k"&gt;for&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="kt"&gt;int&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;0&lt;/span&gt;&lt;span class="o"&gt;;&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="o"&gt;;&lt;/span&gt;&lt;span class="n"&gt;i&lt;/span&gt;&lt;span class="o"&gt;++)&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;array&lt;/span&gt;&lt;span class="o"&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;x&lt;/span&gt;&lt;span class="o"&gt;)&lt;/span&gt;
      &lt;span class="k"&gt;break&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="o"&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;n&lt;/span&gt;&lt;span class="o"&gt;)&lt;/span&gt;
      &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt; &lt;span class="c1"&gt;// the element is not present in the array&lt;/span&gt;
    &lt;span class="k"&gt;for&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;j&lt;/span&gt;&lt;span class="o"&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;j&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="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;&lt;span class="n"&gt;j&lt;/span&gt;&lt;span class="o"&gt;++)&lt;/span&gt;
      &lt;span class="n"&gt;array&lt;/span&gt;&lt;span class="o"&gt;[&lt;/span&gt;&lt;span class="n"&gt;j&lt;/span&gt;&lt;span class="o"&gt;]=&lt;/span&gt;&lt;span class="n"&gt;array&lt;/span&gt;&lt;span class="o"&gt;[&lt;/span&gt;&lt;span class="n"&gt;j&lt;/span&gt;&lt;span class="o"&gt;+&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="o"&gt;];&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;n&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="o"&gt;);&lt;/span&gt; &lt;span class="c1"&gt;// returns the size of array after deletion&lt;/span&gt;
&lt;span class="o"&gt;}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h1&gt;
  
  
  4. Sort an array (Ascending order).
&lt;/h1&gt;

&lt;p&gt;Java has an arrays class which can be used to sort arrays by importing java.util.Arrays.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="nc"&gt;Arrays&lt;/span&gt;&lt;span class="o"&gt;.&lt;/span&gt;&lt;span class="na"&gt;sort&lt;/span&gt;&lt;span class="o"&gt;(&lt;/span&gt;&lt;span class="n"&gt;array&lt;/span&gt;&lt;span class="o"&gt;);&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;These were the basic manipulation of arrays that can get you started with. If you want to dive deeper and master them to crack technical interviews, then try to build your logic to solve the following questions:&lt;/p&gt;

&lt;p&gt;-&amp;gt; How to reverse an array?&lt;br&gt;
-&amp;gt; How to find leaders in an array?&lt;br&gt;
-&amp;gt; How to left rotate an array?&lt;br&gt;
-&amp;gt; What is kadane's algorithm?&lt;br&gt;
-&amp;gt; What is the sliding window technique?&lt;br&gt;
-&amp;gt; How to solve the Trapping rainwater problem?&lt;br&gt;
-&amp;gt; How to remove duplicate elements in an array?&lt;br&gt;
-&amp;gt; How to find subarrays for a given condition?&lt;/p&gt;

&lt;p&gt;If you can explore the above-listed problems and as well as solve the questions on your favorite coding platform, that should give you enough confidence to crack any type of coding question based on arrays. 🎉&lt;/p&gt;

&lt;p&gt;To get started with, try &lt;a href="https://www.hackerrank.com/"&gt;Hackerrank&lt;/a&gt; or &lt;a href="https://www.hackerearth.com/"&gt;Hackerearth&lt;/a&gt;. 👩🏻‍💻&lt;/p&gt;

&lt;p&gt;Happy learning! happy coding! 💖&lt;/p&gt;

</description>
      <category>java</category>
      <category>datastructures</category>
      <category>algorithms</category>
      <category>tutorial</category>
    </item>
    <item>
      <title>Java: The datatypes. {}</title>
      <dc:creator>Raksha Kannusami </dc:creator>
      <pubDate>Wed, 22 Jul 2020 10:36:46 +0000</pubDate>
      <link>https://dev.to/rakshakannu/java-the-datatypes-4b3a</link>
      <guid>https://dev.to/rakshakannu/java-the-datatypes-4b3a</guid>
      <description>&lt;h1&gt;
  
  
  🎯 What is a data type?
&lt;/h1&gt;

&lt;p&gt;Wikipedia says "&lt;em&gt;In computer science and computer programming, a data type or simply type is an attribute of data which tells the compiler or interpreter how the programmer intends to use the data. Most programming languages support basic data types of integer numbers (of varying sizes), Floating-point numbers (which approximate real numbers), characters, and Booleans. A data type constrains the values that an expression, such as a variable or a function, might take. This data type defines the operations that can be done on the data, the meaning of the data, and the way values of that type can be stored. A data type provides a set of values from which an expression (i.e. variable, function, etc.) may take its values.&lt;/em&gt;"&lt;/p&gt;

&lt;h1&gt;
  
  
  🎯 Types:
&lt;/h1&gt;

&lt;p&gt;There are 2 types of data types in &lt;strong&gt;Java&lt;/strong&gt;: &lt;strong&gt;Primitive&lt;/strong&gt; and &lt;strong&gt;Non-Primitive&lt;/strong&gt;. In simple words, primitive data types are predefined whereas non-primitive data types are user defined.&lt;/p&gt;

&lt;h1&gt;
  
  
  🎯 Primitive Datatypes:
&lt;/h1&gt;

&lt;p&gt;A primitive data type specifies the size and type of variable values and has no additional methods. There are 8 primitive data types in Java: &lt;strong&gt;byte, short, int, long, float, double, boolean, char&lt;/strong&gt;. Let us see how to initialize them below.&lt;/p&gt;

&lt;p&gt;Byte&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;byte&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mi"&gt;10&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Short&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;short&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mi"&gt;10&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Int&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;int&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mi"&gt;10&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Long&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;long&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mi"&gt;10000000&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Float&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;float&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mi"&gt;10&lt;/span&gt;&lt;span class="n"&gt;f&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Double&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;double&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mf"&gt;10.1010&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Boolean&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;boolean&lt;/span&gt; &lt;span class="n"&gt;x&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Char&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;char&lt;/span&gt; &lt;span class="n"&gt;c&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="sc"&gt;'s'&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;h1&gt;
  
  
  🎯 Non-Primitive Datatypes:
&lt;/h1&gt;

&lt;p&gt;Non-primitive data types are called reference types because they refer to objects. There are many non-primitive data types in Java: &lt;strong&gt;arrays, strings, classes etc&lt;/strong&gt;. Let us see how to initialize an array and a string.&lt;/p&gt;

&lt;p&gt;Array&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="kt"&gt;int&lt;/span&gt;&lt;span class="o"&gt;[]&lt;/span&gt; &lt;span class="n"&gt;array&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="k"&gt;new&lt;/span&gt; &lt;span class="kt"&gt;int&lt;/span&gt;&lt;span class="o"&gt;[&lt;/span&gt;&lt;span class="mi"&gt;10&lt;/span&gt;&lt;span class="o"&gt;];&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;String&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight java"&gt;&lt;code&gt;&lt;span class="nc"&gt;String&lt;/span&gt; &lt;span class="n"&gt;s&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="s"&gt;"hello world"&lt;/span&gt;&lt;span class="o"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Since now we know what data types are, it is important to learn the usage of these data types so that we know where to use them to solve a problem.&lt;/p&gt;

&lt;p&gt;...To be continued! 🎉&lt;br&gt;
keep learning, keep coding!💖&lt;/p&gt;

</description>
      <category>java</category>
      <category>tutorial</category>
      <category>codenewbie</category>
      <category>computerscience</category>
    </item>
  </channel>
</rss>
