<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Estefania Cassingena Navone on Medium]]></title>
        <description><![CDATA[Stories by Estefania Cassingena Navone on Medium]]></description>
        <link>https://medium.com/@estefaniacn?source=rss-61ce348a12bc------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*Dsp7Jn6U3wrH8p2TY9DhWg.jpeg</url>
            <title>Stories by Estefania Cassingena Navone on Medium</title>
            <link>https://medium.com/@estefaniacn?source=rss-61ce348a12bc------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Tue, 17 Nov 2026 21:09:13 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@estefaniacn/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[Data Structures 101: Arrays — A Visual Introduction for Beginners]]></title>
            <link>https://medium.com/free-code-camp/data-structures-101-arrays-a-visual-introduction-for-beginners-7f013bcc355a?source=rss-61ce348a12bc------2</link>
            <guid isPermaLink="false">https://medium.com/p/7f013bcc355a</guid>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[computer-science]]></category>
            <category><![CDATA[tech]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[data-structures]]></category>
            <dc:creator><![CDATA[Estefania Cassingena Navone]]></dc:creator>
            <pubDate>Tue, 12 Feb 2019 16:29:51 GMT</pubDate>
            <atom:updated>2019-02-12T16:29:51.805Z</atom:updated>
            <content:encoded><![CDATA[<h3>Data Structures 101: Arrays — A Visual Introduction for Beginners</h3><h4>Get to know the data structures that you use every day</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*plaTqL5DDa2MgqeK-0EClg.png" /></figure><h3>👋 Welcome! Let’s Start with some Vital Context</h3><p>Let me ask you this: <br>✅ Do you listen to music on your smartphone?<br>✅ Do you keep a list of contacts on your phone?<br>✅ Have you ever seen a leaderboard during a competition?</p><p><strong>If your answer is “yes” to any of these questions, then it’s almost certain that you’ve used arrays and you didn’t even know it! 😃 </strong>Arrays are very powerful data structures that store<strong> lists of elements. </strong>They have endless applications. They are very important in the world of computer science.</p><p>In this article, you will learn the pros and cons of arrays, their structure, operations, and use cases.</p><p><strong>Let’s begin! 👍</strong></p><h3>🔎 Deep Dive Into the Basic Structure of Arrays</h3><p>To understand how they work, it’s very helpful to visualize your computer’s memory as a grid, just like the one below. Each piece of information is stored in one of those small elements (squares) that make the grid.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/960/0*Mxb5neLVithb1rQG.png" /></figure><p><strong>Arrays </strong>take advantage of this “grid” structure to<strong> store</strong> <strong>lists of related information in</strong> <strong>adjacent memory locations </strong>to guarantee extreme efficiency for finding those values. 🔳🔳🔳🔳</p><p><strong>You can think of arrays like this:</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/817/1*oGDs9kTLiQWy-ZW4zorqXw.png" /></figure><p><strong>Their elements are next to each other in memory.</strong> If you need to access more than one of them, the process is extremely optimized because your computer already knows where the value is located.</p><p>Awesome, right? Let’s learn how this works behind the scenes! 😃</p><h4>📚 Classification</h4><p>Arrays are classified as <strong>Homogeneous Data Structures </strong>because they<strong> </strong>store <strong>elements of the same type</strong>.</p><p>They can store numbers, strings, boolean values (true and false), characters, objects, and so on. But <strong>once you define the type of values that your array will store,</strong> <strong>all its elements must be of that same type. You can’t “mix” different types of data.</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/814/1*Q391CooBVxTvMkqxShxIRQ.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/812/1*srJ8361hg4AfvivDz7FRNw.png" /></figure><h3>👀 Reading Values — The Magic Begins!</h3><p>The amazing power of arrays comes from their <strong>efficiency to access values</strong>. This is achieved thanks to its grid-like structure. Let’s take a look at this in more detail.🔍</p><p><strong>When you create an array, you:</strong><br>- Assign it to a variable. 👈<br>- Define the type of elements that it will store. 🎈<br>- Define its size (the maximum number of elements). 📚</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/713/1*XTgJzSMY0cbDYVGrjBwcNA.png" /></figure><p><strong>💡 Note: </strong>The name that you assign to this variable is very important because you will use it later in your code to access values and to modify the array.</p><p>But how can you tell the computer which particular value you would like to access? This is where indices take a vital role!</p><h4>1️⃣ Indices</h4><p><strong>You use what it’s called an “index”</strong> (“indices” in plural) to access a value in an array. This is a number that refers to the location where the value is stored.</p><p>As you can see in the diagram below, the first element in the array is referred to using index 0. As you move further to the right, the index increases by one for each space in memory.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/796/1*IGEqMUm9J7G7TGmLJscxFw.png" /></figure><p><strong>💡 Note: </strong>I know that it seems strange at first to start counting from 0 instead of 1, but this is called <a href="https://en.wikipedia.org/wiki/Zero-based_numbering">Zero-Based Numbering</a>. It’s very common in computer science.</p><p><strong>The general syntax to access an element is:</strong> <strong>&lt;ArrayVariable&gt;[&lt;index&gt;]</strong></p><p><strong>For example: </strong><br>If your array is stored in the variable <strong>myArray</strong> and you want to access the first element (at index 0), you would use <strong>myArray[0]</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/856/1*HeMBXksQiNW-B9oCIkYa_w.png" /></figure><h4>2️⃣ Memory</h4><p>Now that you know how to access values, let’s see how arrays are stored in your computer’s memory. <strong>When you define the size of the array, all of that space in memory is “reserved” from that moment on</strong> for future values that you may want to insert.</p><p><strong>💡 Note:</strong> If you do not fill the array with values, that space will be kept reserved and empty until you do.</p><p><strong>For Example:</strong><br>Let’s say that you define an array of size 5 but only insert one value. All that remaining space will be empty and “reserved” in memory, waiting for future assignments.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/821/1*jrus_dmF5EHc1jzllytVLQ.png" /></figure><p>This is key because arrays are extremely efficient in accessing values because all the elements are stored in contiguous spaces in memory. <strong>This way, the computer knows exactly where to look to find the information you requested.</strong></p><p><strong>But… </strong>there is a downside to it 😞 because this is <strong>not memory-efficient</strong>. You are reserving memory for future operations that may not occur. <strong>This is why arrays are recommended in situations when you know beforehand how many elements you are going to store.</strong></p><h3>🔧 Operations — Behind the Scenes!</h3><p>Now that you know what arrays are when they are used, and how they store elements, we will dive into their operations like insertion and removal.</p><h4>1️⃣ Insertion — Welcome!</h4><p>Let’s say that we have an array of size 6 and there’s still an empty space. We want to insert an element “e” at the beginning of the array (index 0), but this place is already taken by the element “a.” What should we do?</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/992/1*a7V9SW62vNae8eEzp4Ol5g.png" /></figure><p><strong>To insert into arrays</strong>, we move all the elements located to the right of the insertion site, one index to the right. Element “a” will now be at index 1, element “b” will be at index 2 and so on…</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/987/1*fqqzMwBdCkI7hjrNFbA2eA.png" /></figure><p><strong>💡 Note:</strong> You will need to create a variable to keep track of the last index that contains elements. In the diagram above, the array is filled up to index 4 before the insertion. This way, you can determine if the array is full and what index you should use to insert an element at the end.</p><p>After doing this, our element is successfully inserted. 👏</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/977/1*aic9g5dtXaLh4lW2dDailQ.png" /></figure><h4>⚠️ Wait a minute! What Happens if the Array is Full?</h4><p>What do you think will happen if the <strong>array is full and you try to insert</strong> an element? 😱</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/866/1*8fMdhP9JzR3g6kPPjk841g.png" /></figure><p><strong>In this case, you need to create a new, larger array and manually copy all the elements into this new array. </strong>This operation is <strong>very expensive, time-wise.</strong> Imagine what would happen if you had an array with millions of elements! That could take a very long time to complete. ⏳</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/734/1*yi3LoLMx_si09DI7RTtndA.png" /></figure><p><strong>💡 Note:</strong> The only exception to this rule, when insertion is very fast, is when you insert an element at the<strong> end</strong> of the array (at the index located to the right of the last element) and there is still space available. This is done in constant time O(1).</p><h4>2️⃣ Deletion— Bye, Bye!</h4><p>Now let’s say that you want to delete an element from the array.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/753/1*jY0vI7Hvon1sbfABQUF8vQ.png" /></figure><p>To maintain the efficiency of random access (being able to access the array through an index extremely fast) the elements must be stored in contiguous spaces of memory. <strong>You can’t just delete the element and leave that space empty.</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/760/1*haCVs2tSpRUxXog46RGIeg.png" /></figure><p>You should move the elements that come after the element that you want to delete one index the left.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/755/1*QMm-l_Hms-SIOt_3UvNuEg.png" /></figure><p>And finally, you have this resulting array 👇. As you can see, “b” has been successfully deleted.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/753/1*EA4QOQ7BQgj8ykF1W9S8Ug.png" /></figure><p><strong>💡 Note: </strong>Deletion is very efficient when you remove the <strong>last </strong>element. Since you need to create a variable to keep track of the last index that contains elements (in the diagram above, index 3), you can directly remove that element using the index.</p><h4>3️⃣ Finding an Element</h4><p>You have three options to find an element in an array:</p><ul><li><strong>If you know where it’s located</strong>, use the index.</li><li><strong>If you don’t know where it’s located and your data is sorted</strong>, you can use algorithms to optimize your search, such as Binary Search.</li><li><strong>If you don’t know where it’s located and your data is not sorted</strong>, you will need to search through every element in the array and check if the current element is the element you are looking for (please see the sequence of diagrams below 👀).</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/772/1*7dMwATMa02gyEcJ1so6Sww.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/766/1*yXsVWAHbMDI26bPPfYMyHg.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/767/1*R3HJILanJGJnvb_FC7-t_A.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/764/1*MPi4yooY-R2X2Sla_ByWQw.png" /></figure><h3>👋 In Summary…</h3><ul><li><strong>Arrays are extremely powerful data structures</strong> that store elements of the same type. The type of elements and the size of the array are fixed and defined when you create it.</li><li><strong>Memory is allocated immediately</strong> after the array is created and it’s empty until you assign the values.</li><li>Their <strong>elements are located in contiguous locations in memory</strong>, so they can be accessed very efficiently (random access, O(1) = constant time) using <strong>indices</strong>.</li><li><strong>Indices start at 0</strong>, not 1 like we are used to.</li><li><strong>Inserting elements</strong> at the beginning or in the middle of the array involves moving elements to the right. If the array is full, creating a new, larger array (which is not very efficient). Inserting at the end of the array is very efficient, constant time O(1).</li><li><strong>Removing elements</strong> from the beginning or from the middle of the array involves moving all the elements to the left to avoid leaving an empty space in memory. This guarantees that the elements are stored in contiguous spaces in memory. Removing at the end of the array is very efficient because you only delete the last element.</li><li><strong>To find an element</strong>, you need to check the entire array until you find it. If the data is sorted, you can use algorithms such as Binary Search to optimize the process.</li></ul><blockquote><em>“Learn from yesterday, live for today, hope for tomorrow. The important thing is not to stop questioning.”</em></blockquote><blockquote><em>— Albert Einstein</em></blockquote><h4>👋 Thank you!</h4><p>I really hope that you liked my article. ❤️<br>I sincerely appreciate your claps and comments.👏<br><strong>Follow me on </strong><a href="https://medium.com/@estefaniacn"><strong>Medium</strong></a> | <a href="https://twitter.com/Estefania_CN_">Twitter</a> to find more articles like this one. 😃</p><figure><img alt="" src="https://cdn-images-1.medium.com/proxy/1*kYMkxO_U5b5SQgsQBQr5lA.gif" /></figure><p>💡 You may enjoy reading my articles on Data Structures:</p><ul><li><a href="https://medium.freecodecamp.org/data-structures-101-graphs-a-visual-introduction-for-beginners-6d88f36ec768">Data Structures 101: Graphs — A Visual Introduction for Beginners</a></li><li><a href="https://medium.com/techmacademy/data-structures-101-linked-lists-behind-the-scenes-7a564cecc29f">Data Structures: Linked Lists —  Behind the Scenes Visual Tour</a></li><li><a href="https://medium.com/techmacademy/graphs-adjacency-matrix-behind-the-scenes-visual-tour-6512493912c0">Graphs: Adjacency Matrices— Behind the Scenes Visual Tour</a></li></ul><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=7f013bcc355a" width="1" height="1" alt=""><hr><p><a href="https://medium.com/free-code-camp/data-structures-101-arrays-a-visual-introduction-for-beginners-7f013bcc355a">Data Structures 101: Arrays — A Visual Introduction for Beginners</a> was originally published in <a href="https://medium.com/free-code-camp">We’ve moved to freeCodeCamp.org/news</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Leading Zeros in Python: A Hidden Mystery Revealed]]></title>
            <link>https://medium.com/techmacademy/leading-zeros-in-python-a-hidden-mystery-revealed-ee3e3065634d?source=rss-61ce348a12bc------2</link>
            <guid isPermaLink="false">https://medium.com/p/ee3e3065634d</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[computer-science]]></category>
            <category><![CDATA[python-programming]]></category>
            <category><![CDATA[tech]]></category>
            <category><![CDATA[technology]]></category>
            <dc:creator><![CDATA[Estefania Cassingena Navone]]></dc:creator>
            <pubDate>Tue, 05 Feb 2019 14:47:43 GMT</pubDate>
            <atom:updated>2019-02-05T14:47:43.520Z</atom:updated>
            <content:encoded><![CDATA[<h4>Interesting Python Tips &amp; Tricks</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*76HrxLdYteHZhCGV6IZ3cA.png" /></figure><h3>👋 Welcome!</h3><p>✔️ Did you know that Python 3 doesn’t accept leading zeros for integers? <br>✔️ Did you know that Python 2 <strong>did</strong> accept leading zeros? <br>✔️ Do you want to know why? 👍</p><p>In this article, you will learn exactly why and what changed. You’ll be surprised to know that it has to do why the <strong>octal</strong> numeral system.</p><p>Amazing, right? 😄 Let’s dive into the details!</p><h3>✅ Python 2 — Leading Zeros… Here We Go!</h3><p>In this version of Python, you were able to add leading zeros to your liking without causing any errors. Expressions like these were allowed:</p><pre><strong>print(000000000000000015)<br>print(000000000000000025.6)<br>print(053)<br>print(-00004)<br>var1 = 0075</strong></pre><p>I’m sure that you must be thinking: why would they allow this if leading zeros don’t add anything to the result?</p><p><strong>0000015 should be equivalent to 15, right? 😟</strong></p><p>⚠️ <strong>Not in Python 2! 😱</strong></p><p>The first zero in <strong>0</strong>000015 acts like a “flag” 🚩 that tells the Python interpreter that the number is expressed in the <strong>octal numeral system (base 8) </strong>instead of the decimal system that we usually work with (base 10).</p><pre># In Python 2<br><strong>&gt;&gt;&gt; 0000015<br>13</strong></pre><p>This is why the interpreter returns the number 13 when we type 0000015. The number is converted from the octal numeral system to the decimal numeral system. (I included a brief explanation of this process below 👍).</p><p>But <strong>how can we tell Python that this number is already in the decimal numeral system,</strong> and<strong> </strong>that the leading zeros shouldn’t change the result?</p><p>This is where Python 3 comes to the rescue! 🎊</p><h3>✅ Python 3— Bye, Bye, Leading Zeros!</h3><p>In Python 3, this is not a problem anymore because the “flag” 🚩 is much clearer now to differentiate numbers in the <strong>octal numeral system</strong>. The number must start with <strong>0o</strong> or <strong>0O</strong> (zero followed by an “o” letter in lowercase or uppercase).</p><pre><strong>&gt;&gt;&gt; 0o0000015  </strong># Notice the &quot;flag&quot; 0o<strong><br>13<br>&gt;&gt;&gt; 0O0000015  </strong># Notice the &quot;flag&quot; 0O<strong><br>13<br>&gt;&gt;&gt; 0000015    </strong># We didn&#39;t add the &quot;flag&quot;, so an error is thrown<strong><br>SyntaxError: invalid token</strong></pre><p>In the last example, you can see that in Python 3, if we try to write an integer with leading zeros, an error is thrown because this version already implemented a way to differentiate both numeral systems.</p><p><strong>💡 Tips:</strong> In Python 3, decimal numbers and zeros do accept leading zeros.</p><pre><strong>&gt;&gt;&gt; 000000000000000  </strong># A sequence of zeros is transformed into 0<strong><br>0<br>&gt;&gt;&gt; 000005.6         </strong># A decimal number<strong><br>5.6</strong></pre><h3>✅ Quick Tips: Octal Numeral System</h3><p>I’m sure that you must be curious about this numeral system, so let’s analyze how 0000015 becomes 13 in Python 2. 😄</p><h4>1️⃣ Decimal System</h4><p><strong>This is the numeral system that we usually use in practice.</strong> It has base 10, which means that each digit is multiplied by 10 raised to a power to obtain the final result. The digits allowed in the decimal numeral system are 0–9.</p><p><strong>For example: </strong><br>1365 in the decimal numeral system is 1*(10³)+3*(10²)+6*(10¹)+5*(10⁰)<br>This is equivalent to 1000 + 300 + 60 + 5 = 1365.</p><p>See how we multiply each digit by 10 raised to a power starting from 0 and increasing by one for each place to the left?</p><h4>2️⃣ Octal System</h4><p><strong>In contrast, numbers in the octal numeral system have base 8.</strong> This means that instead of multiplying by 10 raised to a power, we multiply by 8 raised to a power to transform the number to its equivalent number in the decimal system. The digits allowed in the octal numeral system are 0–7.</p><p><strong>For example:</strong><br>2536 in the octal numeral system is 2*(8³) +5*(8²)+3*(8¹)+6*(8⁰).<br>This is equivalent to 1024 + 320 + 24 + 6 = 1374 in the decimal system.</p><pre><strong>&gt;&gt;&gt; 02536 </strong># In Python 2, the first 0 is the flag.<strong><br>1374</strong></pre><p><strong>💡 Note:</strong> Using a digit greater than 7 would cause an error.</p><pre># Example in Python 3<strong><br>&gt;&gt;&gt; 0o0008<br>SyntaxError: invalid syntax </strong></pre><h4>👋 Thank you!</h4><p>I really hope that you liked my article. ❤️<br>I sincerely appreciate your claps and comments.👏<br><strong>Follow me on </strong><a href="https://medium.com/@estefaniacn"><strong>Medium</strong></a> | <a href="https://twitter.com/Estefania_CN_">Twitter</a> to find more articles like this. 😃</p><figure><img alt="" src="https://cdn-images-1.medium.com/proxy/1*kYMkxO_U5b5SQgsQBQr5lA.gif" /></figure><p>💡 You may enjoy reading my articles:</p><ul><li><a href="https://medium.freecodecamp.org/data-structures-101-graphs-a-visual-introduction-for-beginners-6d88f36ec768">Data Structures 101: Graphs — A Visual Introduction for Beginners</a></li><li><a href="https://medium.com/techmacademy/graphs-adjacency-matrix-behind-the-scenes-visual-tour-6512493912c0">Graphs: Adjacency Matrices— Behind the Scenes Visual Tour</a></li><li><a href="https://medium.com/techmacademy/data-structures-101-linked-lists-behind-the-scenes-7a564cecc29f">Data Structures: Linked Lists —  Behind the Scenes Visual Tour</a></li></ul><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=ee3e3065634d" width="1" height="1" alt=""><hr><p><a href="https://medium.com/techmacademy/leading-zeros-in-python-a-hidden-mystery-revealed-ee3e3065634d">Leading Zeros in Python: A Hidden Mystery Revealed</a> was originally published in <a href="https://medium.com/techmacademy">Techmacademy</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Data Structures 101: Graphs — A Visual Introduction for Beginners]]></title>
            <link>https://medium.com/free-code-camp/data-structures-101-graphs-a-visual-introduction-for-beginners-6d88f36ec768?source=rss-61ce348a12bc------2</link>
            <guid isPermaLink="false">https://medium.com/p/6d88f36ec768</guid>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[tech]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[computer-science]]></category>
            <category><![CDATA[technology]]></category>
            <dc:creator><![CDATA[Estefania Cassingena Navone]]></dc:creator>
            <pubDate>Mon, 21 Jan 2019 17:58:53 GMT</pubDate>
            <atom:updated>2019-01-21T17:58:53.846Z</atom:updated>
            <content:encoded><![CDATA[<h3>Data Structures 101: Graphs — A Visual Introduction for Beginners</h3><h4>Get to know the data structures that you use every day</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*EBtSVCSmRvw40Bmu9vP69A.png" /></figure><h3>👋 Welcome! Let’s Start with Some Vital Context.</h3><p>Let me ask you something:<br><strong>✅ Do you use Google Search? <br>✅ Do you use Google Maps? <br>✅ Do you use social media sites?</strong></p><p><strong>If your answer is “yes” to any of these questions, then you’ve definitely used graphs and you didn’t even know it! Surprised? 😲 I was, too! </strong>This article will give you a visual introduction to the world of graphs, their purpose, elements, and types.</p><p><strong>These data structures really caught my attention due to their amazing capabilities. </strong>They are so powerful that you won’t even imagine how diverse their real-world applications can be. <strong>Let’s begin!</strong> 😁</p><h3>🌐 Real-World Applications — The Magic Begins!</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/571/0*pcBJE1ixkWrdm1tK.png" /></figure><p><strong>Graphs are used in diverse industries and fields:</strong></p><ul><li><strong>GPS systems and Google Maps</strong> use graphs to find the shortest path from one destination to another.</li><li><strong>Social Networks</strong> use graphs to represent connections between users.</li><li><strong>The Google Search</strong> algorithm uses graphs to determine the relevance of search results.</li><li><strong>Operations Research</strong> is a field that uses graphs to find the optimal path to reduce the cost of transportation and delivery of goods and services.</li><li><strong>Even Chemistry </strong>uses graphs<strong> </strong>to represent molecules!!! ❤️</li></ul><p>Their applications are amazing, right? <br>Let’s start our journey through this world! 😄</p><h3>🔵 Meet Graphs!</h3><p>Now that you have some context, let’s start by talking about their main purpose and elements.</p><p><strong>Graphs are used to represent, find, analyze, and optimize connections between elements (houses, airports, locations, users, articles, etc.).</strong></p><p>This is an example of what a graph looks like:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/654/1*97KXRr1DoijfrfJIcYnF9g.png" /><figcaption>Graph.</figcaption></figure><h4>💠 Building-Blocks</h4><p>I’m sure that you noticed two main elements in the diagram above: circles and thick lines connecting them. They are called, respectively, <strong>Nodes</strong> and <strong>Edges</strong>.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/675/1*SnFSPX_v7xdt3mc0x5wAUg.png" /></figure><p><strong>Let’s see them in more detail! 👍</strong></p><ul><li><strong>Nodes:</strong> they are the <strong>elements</strong> that create the network. They could represent <strong>houses, locations, airports, ports, bus stops, buildings, users, </strong>basically anything that you could represent as being connected to other similar elements in a network.</li><li><strong>Edges:</strong> they are <strong>connections</strong> between the nodes. They could represent <strong>streets, flights, bus routes, a connection between two users in a social network,</strong> or anything that could possibly represent a connection between the nodes in the context that you are working with.</li></ul><h4>😱 What Happens If There Is No Connection?</h4><p>If two nodes are not connected by an edge, that means that there is <strong>no direct connection between them.</strong> But don’t panic! 😩 You might still be able to go from one node to another by <strong>following a sequence of edges</strong>, similar to driving through several streets to reach your final destination. 🚛️ 🚛 🚛</p><p>For example, in the diagram below, even though there is no <strong>direct </strong>connection (<strong>edge</strong>) between the <strong>purple node </strong>(left) and the <strong>yellow node </strong>(right), you can go from the purple node to the orange node, to the pink node, to the green node, and finally reach the yellow node. 🏁</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/884/1*288aTUmLbOPZH1X3aV1wQQ.png" /><figcaption>No direct connection between the purple and yellow node.</figcaption></figure><p>This is a key aspect of graphs, that you can <strong>search for the element that you are looking for by following the paths available.</strong></p><h3>🌟 Notation &amp; Terminology</h3><p>It’s very important to learn the formal “language” to work with graphs:</p><ul><li><strong>|V|</strong> = Total <strong>number of vertices </strong>(<strong>nodes</strong>) in the graph.</li><li><strong>|E|</strong> = Total <strong>number of connections</strong> (<strong>edges</strong>) in the graph.</li></ul><p>In the example below, <strong>|V| = 6</strong> because there are six nodes (circles) and<br><strong>|E| = 7 </strong>because there are seven edges (lines).</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/663/1*v_g4-4aCRrAHNf9zoa-I8Q.png" /><figcaption>Graph.</figcaption></figure><h3>📚 Types of Graphs</h3><p>Graphs are classified based on the characteristics of their edges (connections). <strong>Let’s take a look them in detail! 😃</strong></p><h4>1️⃣ Directed Graphs</h4><p><strong>In directed graphs, edges have a direction.</strong> They go from one node to another, and there is no way to return to the initial node through that edge.</p><p>As you can see in the diagram below, <strong>the edges (connections) now have arrows that point to a specific direction.</strong> <strong>Think of these edges as one-way streets.</strong> You can go in one direction and reach your destination, but you can’t return through that same street, so you need to find an alternative path.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/623/1*Eqgwk0QgGIfFoDSq_aBAzg.png" /><figcaption>Directed Graph.</figcaption></figure><p>🍕 For example, if we create a graph for a pizza delivery service, representing a city, two houses (nodes) may be<strong> connected by a one-way street (edge)</strong>. You could get from house A to house B through this street, but you couldn’t go back, so you would have to take an alternative path.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/655/1*u5j3VvEs7G1L9HtYQcXfiw.png" /></figure><p><strong>💡 Note:</strong> In a directed graph, <strong>you may not be able return at all to your initial location </strong>if there is no path with the appropriate directions. 😞 In the diagram below, you can see that you can successfully go from the purple node to the green node, but notice that there is no way to return from the green node to the purple node because the edges are “one-way streets.”</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/890/1*C8Cmd4TLBt13hsNrMmDyeA.png" /><figcaption>Point of No Return.</figcaption></figure><h4>2️⃣ Undirected Graphs</h4><p><strong>In this type of graph, edges are undirected (they do not have a specific direction). </strong>Think of undirected edges as two-way streets. You can go from one node to another and return through that same “path”.</p><p><strong>💡 Note: </strong>When you see a diagram of a graph where the edges don’t have arrows pointing in a specific direction, you can assume that the graph is undirected.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/643/1*CZih0IWdD_n9whxvsI2vLg.png" /></figure><p>🍕 For our pizza delivery service, this would mean that the delivery motorcycle can <strong>go from the source to the destination through the same street or path (</strong>To their relief ! 😇).</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/651/1*3pFr5uatqZ9c_HfiT2b1Bw.png" /></figure><p>In the graph below, you could go <strong>from the purple node to the green node and back through the same path</strong>, so you don’t reach a point no return. 😌</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/866/1*8P67Y_lQ3AXcwt4pLzdLug.png" /><figcaption>You can go back!</figcaption></figure><h3>🏋 Weights? — Yes, Weights!</h3><h4>1️⃣ Weighted Graphs</h4><p><strong>In weighted graphs, each edge has a value associated with it (called weight)</strong>. This value is used to represent a certain quantifiable relationship between the nodes they connect.</p><p>For example, weights could represent <strong>distance, time, the number of connections shared between two users in a social network,</strong> or anything that could be used to describe the connection between nodes in the context that you are working with.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/646/1*Jjd7qTNuFL9bKT4qpMRWLA.png" /><figcaption>Weighted Graph.</figcaption></figure><p>These weights are used by <a href="https://www.cs.usfca.edu/~galles/visualization/Dijkstra.html"><strong>Dijkstra’s Algorithm</strong></a> to optimize routes by finding the shortest or least expensive paths between nodes in a network. (Stay tuned for an article on Dijkstra’s Algorithm! 😃).</p><h4>2️⃣ Unweighted Graphs</h4><p>In contrast, unweighted graphs <strong>do not have weights associated with their edges.</strong> An example of this type of graph can be found in social networks, where edges represent the connection between two users. The connection cannot be quantified. Therefore, the edge has no weight.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/624/1*CsmTArbMwQ5A1YDGRoBF9w.png" /><figcaption>Unweighted Graph.</figcaption></figure><p><strong>💡 Note:</strong> You may have noticed that, so far, our graphs only have one edge connecting each pair of nodes. It’s natural to ask if there could be more than one edge between a pair of nodes.<strong> </strong>Actually, this is possible with <strong>Multigraphs! </strong>They can have multiple edges connecting the same pair of nodes.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/605/1*jN_xT4goLXjeE3F6-x-lBQ.png" /><figcaption>Multigraph.</figcaption></figure><h3>🏆 Number of Edges! — An Important Factor</h3><p>It’s very important to know if a graph has many or few edges because this is a crucial factor to decide how you will represent this data structure in your code. <strong>Let’s see the different types! 👍</strong></p><h4>1️⃣ Dense Graphs</h4><p><strong>Dense graphs have many edges. But, wait! ⚠️ </strong>I know what you must be thinking, how can you determine what qualifies as “many edges”? This is a little bit too subjective, right? 😇 I agree with you, so let’s quantify it a little bit:</p><p>👉<strong> Let’s find the maximum number of edges in a directed graph. </strong>If there are <strong>|V|</strong> nodes in a directed graph (in the example below, six nodes), that means that each node can have up to <strong>|v|</strong> connections (in the example below, six connections).</p><p>Why? Because <strong>each node could potentially connect with all other nodes and with itself</strong> (see “loop” below)<strong>. </strong>Therefore, <strong>the</strong> <strong>maximum number of edges that the graph can have is </strong><strong>|V|*|V|</strong> , which is the total number of nodes multiplied by the maximum number of connections that each node can have.</p><p><strong>When the number of edges in the graph is close to the maximum number of edges, the graph is dense. 😉</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/663/1*v_g4-4aCRrAHNf9zoa-I8Q.png" /><figcaption>Graph.</figcaption></figure><p>💡 <strong>Note:</strong> “Loops” occur when a node has an edge that connects it to itself. Strange and interesting, right? 😄</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/135/1*615Knor4WeeNH9s6a-WOyg.png" /><figcaption>“Loop” representation.</figcaption></figure><h4>6️⃣ Sparse Graphs</h4><p><strong>Sparse Graphs have few edges.</strong> As you can see in the diagram below, there aren’t many connections between the nodes.</p><p><strong>When the number of edges in the graph is significantly fewer than the maximum number of edges, the graph is sparse. 😉</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/647/1*kghuoUvzGOFuq2JT_Lpt7w.png" /><figcaption>Sparse Graph.</figcaption></figure><h3>⭕️ Meet Cycles!</h3><p><strong>Now let’s see a vital concept to understand graphs, cycles.</strong></p><p>You probably noticed that if you follow a sequence of connections in a graph, you may find a <strong>path that will take you back to the same node.</strong> This is like “walking in circles”, exactly as if you were driving around your city and you took a path that could take you back to your initial location. 🚗</p><p><strong>In graphs, these “circular” paths are called “cycles”.</strong> They are <strong>valid paths that start and end at the same node. </strong>For example, in the diagram below, you can see that if you start at any node, you can return to that same node by following the edges.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/386/1*Ncj8mQKuvp87mcBer5IPPw.png" /><figcaption>Sample cycle.</figcaption></figure><p><strong>Cycles are not always “isolated” because they can be part of a larger graph.</strong> You can detect them by starting your search on a specific node and finding a path that takes you back to that same node.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/794/1*Wgh67YxYXUpWeuyn5jkV5Q.png" /><figcaption>Cycle in a graph.</figcaption></figure><h3>👋 In Summary…</h3><ul><li><strong>Graphs are awesome data structures</strong> that you use every day through Google Search, Google Maps, GPS, and social media.</li><li>They are used to <strong>represent elements that share connections</strong>.</li><li>The elements in the graph are called <strong>Nodes</strong> and the connections between them are called <strong>Edges</strong>.</li><li>Graphs can be <strong>directed,</strong> when their edges have a specific orientation, similar to one-way streets, or <strong>undirected, </strong>when their edges don’t have a specific orientation, similar to two-way streets.</li><li>Edges can have a value associated with them, called <strong>weight</strong>.</li><li>If a graph has many edges, it’s called a <strong>dense</strong> graph. Otherwise, if it has few edges, it’s called a <strong>sparse</strong> graph.</li><li>A series of connections can form a <strong>cycle</strong> if they create a path that lets you to return to the same node.</li></ul><p><strong>Continue learning about these amazing data structures!</strong> <strong>It will be totally worth it for your future as a developer.</strong> I’m learning about data structures right now, and I find them completely fascinating. 😃 🎆 ❤️</p><blockquote><em>The important thing is to not stop questioning. Curiosity has its own reason for existing. — Albert Einstein</em></blockquote><h4>👋 Thank you!</h4><p>I really hope that you liked my article. ❤️<br>I sincerely appreciate your claps and comments.👏<br><strong>Follow me on </strong><a href="https://medium.com/@estefaniacn"><strong>Medium</strong></a> | <a href="https://twitter.com/Estefania_CN_">Twitter</a> to find more articles like this. 😃</p><figure><img alt="" src="https://cdn-images-1.medium.com/proxy/1*kYMkxO_U5b5SQgsQBQr5lA.gif" /></figure><p>💡 You may enjoy reading my articles on Data Structures:</p><ul><li><a href="https://medium.com/techmacademy/graphs-adjacency-matrix-behind-the-scenes-visual-tour-6512493912c0">Graphs: Adjacency Matrices— Behind the Scenes Visual Tour</a></li><li><a href="https://medium.com/techmacademy/data-structures-101-linked-lists-behind-the-scenes-7a564cecc29f">Data Structures: Linked Lists —  Behind the Scenes Visual Tour</a></li></ul><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=6d88f36ec768" width="1" height="1" alt=""><hr><p><a href="https://medium.com/free-code-camp/data-structures-101-graphs-a-visual-introduction-for-beginners-6d88f36ec768">Data Structures 101: Graphs — A Visual Introduction for Beginners</a> was originally published in <a href="https://medium.com/free-code-camp">We’ve moved to freeCodeCamp.org/news</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Graphs: Adjacency Matrices— Behind the Scenes Visual Tour]]></title>
            <link>https://medium.com/techmacademy/graphs-adjacency-matrix-behind-the-scenes-visual-tour-6512493912c0?source=rss-61ce348a12bc------2</link>
            <guid isPermaLink="false">https://medium.com/p/6512493912c0</guid>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[tech]]></category>
            <category><![CDATA[computer-science]]></category>
            <dc:creator><![CDATA[Estefania Cassingena Navone]]></dc:creator>
            <pubDate>Thu, 17 Jan 2019 14:30:44 GMT</pubDate>
            <atom:updated>2019-01-17T17:19:03.910Z</atom:updated>
            <content:encoded><![CDATA[<h3>Graphs: Adjacency Matrices — Visual Tour Behind the Scenes</h3><h4>In-Depth Look at the Logic and Code Behind Adjacency Matrices.</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*uf38CjyS-IfBsLVFpfa-kw.png" /></figure><h3>👋 Welcome!</h3><p><strong>Hi there! Graphs are extremely powerful data structures</strong>. They are used to represent a “network” of connected elements.</p><p><strong>In this article, you will learn the logic behind Adjacency Matrices and how you can create them in Python to represent graphs. Let Begin! 😀</strong>🔮</p><h3>1️⃣ Meet Adjacency Matrices</h3><p>This is probably very similar to what you imagine when I mention the word “graph”, right?</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/953/1*MgzhAKe0HCSbk4JFExvcIQ.png" /><figcaption>Adjacency Matrix.</figcaption></figure><p>It’s true, this diagram represents a graph, but don’t you think it’s too abstract to implement it in your code and in real-world scenarios?</p><p><strong>1️⃣ What if your graph had thousands of nodes and connections? <br>2️⃣ How would you represent these connections in your code?</strong></p><p><strong>Don’t worry! Adjacency Matrices come to the rescue! 💥</strong></p><p>They give us a way to <strong>represent our graph following a very efficient and structured procedure</strong>. By creating a matrix (a table with rows and columns), you can represent nodes and edges very easily.</p><p><strong>Let’s see how you can create an Adjacency Matrix step by step! </strong>👍</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/745/1*znQTXbYoWS8nX2xt2jvNRw.png" /><figcaption>Adjacency Matrix.</figcaption></figure><h3>🔨 Let’s Create an Adjacency Matrix</h3><p>We will create an Adjacency Table to represent this graph:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/953/1*MgzhAKe0HCSbk4JFExvcIQ.png" /><figcaption>Adjacency Matrix.</figcaption></figure><h4>1️⃣ Draw Table to Represent the Nodes</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/428/1*9jWui7brk4wCL6KC7csumg.png" /><figcaption>Empty Adjacency Matrix.</figcaption></figure><p>As you can see in the diagram below, the rows and columns are used to represent the nodes in the graph. The graph has Nodes <strong>A</strong>, <strong>B</strong>, <strong>C</strong>, and <strong>D</strong>, so we include them all in the columns and rows. (Yes, repeated! 😊)</p><p><strong>Continue reading to learn why we do this! 😉</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/504/1*usfBzyFTmdI1e5rLFqVvyg.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/759/1*sQ2TxMXFRHy2kyQLG3QdCQ.png" /><figcaption>Graph (left) with an empty Adjacency Matrix to represent it (right).</figcaption></figure><h4>2️⃣ Start Filling in the Blanks</h4><p><strong>Now it’s time to start representing the connections (edges) between the nodes. </strong>This is when you graph starts to come to life! 🔆</p><p>You can start filling in the blanks by row or by column. Depending on what you choose, you will need to analyze the graph differently. Let’s see how you can start analyzing it by rows:</p><p><strong>Node A — Row:<br></strong>If you start with the first row (Node A), you need to check if this Node has an edge directed towards each one of the nodes in the graph (including itself, which are called “loops”).</p><p>When you analyze by row, you need to ask yourself:</p><p><strong>✅ Is there an edge from Node A to itself?<br>✅ Is there an edge from Node A to Node B?<br>✅ Is there an edge from Node A to Node C?</strong><br>…. and so on. You can see the pattern. 👍</p><p><strong>⚠️ If the answer to that question is “yes” for a pair of nodes,</strong> <strong>then you must write 1</strong> in the cell that corresponds to the intersection between that pair of nodes.</p><p><strong>Let’s see this in action! 😅</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/747/1*CccsJLnUhbk6062Fmg88ig.png" /></figure><p>In the diagram below, you can see that the connections from Node A go towards Node B, Node C, and Node D, so you add 1 in the cells where A and B intersect, where A and C intersect, and where A and D intersect. Then, you fill the rest of the row with 0s, since there are no edges coming from Node A towards itself.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/531/1*0Obpmmxr6vzLUzCHVGlySA.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/745/1*nhcAlDaMsWjDiwMCCeoT5A.png" /></figure><p><strong>Node B—Row:<br></strong>There are no edges coming out of this node, so<strong> </strong>you fill the entire row with zeros.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/512/1*F6CqQDeYpU8mzQaa1e4YXg.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/715/1*2Um7H_cfCAfHd1i8t7L6hw.png" /></figure><p><strong>Node C— Row:<br></strong>This node only has one edge coming out towards Node D, so you add 1 in the corresponding cell and complete the row with 0s.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/472/1*OnAD3tPpblnggWL_8njtNA.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/735/1*rHWECG0jppIl6BAJiuCTLw.png" /></figure><p><strong>Node D— Row:<br></strong>Just like Node B, Node D has no edges going towards other nodes, so that entire row will be filled with zeros.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/521/1*ql5XiAmE_vqCfFetsttvKw.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/742/1*Z663sDMnk4SCx9OcOgD48g.png" /></figure><h3>🏅 Voilà! — Our Matrix is Ready! Now Columns 👍</h3><p>Awesome job! Now let’s see how you could fill this matrix <strong>column by column</strong>. You’ll see how we end up finding the exact same matrix.</p><p>To fill the table by columns, you must ask:</p><p><strong>✅ What edges are coming towards Node A?<br>✅ What edges are coming towards Node B?<br>✅ What edges are coming towards Node C?</strong><br>…. and so on. You can see the pattern. 👍</p><p><strong>Node A — Column:<br></strong>Since no edges are <strong>coming towards</strong> Node A, you fill the column with zeros.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/522/1*lUS8db0ctuEAvHjtIS8MTg.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/629/1*pKti3icOfT1Lxmo1zxpF8w.png" /></figure><p><strong>Node B— Column:<br></strong>The only edge coming towards Node B comes from Node A, so you write 1 in that cell and fill the rest of the column with zeros.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/493/1*JJJXetMi0yT6DXngEzgcVA.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/582/1*G8N2KS9JRK-D7CAH7eXD3A.png" /></figure><p><strong>Node C— Column:<br></strong>The only edge coming towards Node C comes from Node A, so you add 1 in that cell and fill the rest of the column with zeros.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/508/1*ofVKFG5CCXkLURzJ5SZD2Q.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/607/1*p76ShyZ7MCej3nIyHH70kg.png" /></figure><p><strong>Node D— Column:<br></strong>There are two edges coming towards Node D, from Nodes A and C, so you add 1 in the corresponding cells and fill the rest of the column with zeros.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/466/1*SPg9FDC1lzWNPjP-IG5BEw.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/585/1*shQJypldP6wsL-LVrU1G4Q.png" /></figure><h3>🏆 Finally! — Our Matrix is Ready! ❤️</h3><p>You can see that the two matrices we obtained are equal, so <strong>both methods are equivalent. </strong>🎉</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/547/1*ph4ELQ3oAwzcAvCB2J7vog.png" /><figcaption>Final Adjacency Matrix.</figcaption></figure><p><strong>💡 Note:</strong> Remember that <strong>undirected graphs</strong> have a two-way connection between connected pair of nodes, so that should be represented in the table as well. When there is an edge between Node A and Node B, there must be an edge between Node B and Node A.</p><h3>🏋 Adjacency Matrices &amp; Weighted Graphs</h3><p>For weighted graphs, where each edge has a weight (value) associated with it, you simply <strong>replace the 1s with the weight of the edge, and 0s with </strong><strong>Null</strong> because 0 can be a valid weight.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/502/1*6WM65m25DS_q0f_j6-A9bQ.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/557/1*6hSwBMk4aj-DCypJqpc4Gw.png" /></figure><h3>🚦 Use Cases</h3><ul><li><strong>Adjacency matrices should be used for dense graphs </strong>(graphs<strong> </strong>that have many edges).</li><li><strong>Otherwise,</strong> <strong>if the graph has very few edges, you would be wasting memory </strong>because the matrix will store many zeros due to the lack of connections. In this case, it’s recommended to use <strong>Adjacency lists </strong>(stay tuned for an article on this topic! 😄)</li></ul><h3>💻 To The Code!</h3><p><strong>The moment you’ve been waiting for has finally arrived! </strong>After learning what an Adjacency Matrix is, and the logic behind it, <strong>let’s dive into the code!</strong></p><p><strong>Here is an example of an unweighted directed graph represented with an Adjacency Matrix 👇</strong></p><iframe src="" width="0" height="0" frameborder="0" scrolling="no"><a href="https://medium.com/media/c1a56bb1d77b8f639b4ea07146a66936/href">https://medium.com/media/c1a56bb1d77b8f639b4ea07146a66936/href</a></iframe><p><strong>Let’s see how this code works behind the scenes: 🔍</strong></p><h4>1️⃣ Set up the Matrix</h4><p>A 2D list, completely filled with zeros, is generated when you create an instance of the graph, thanks to this code:</p><pre>def __init__(self, numNodes):<br>     self.adjacencyMatrix = []<br>     for i in range(numNodes): <br>          self.adjacencyMatrix.append([0 for i in range(numNodes)])<br>     self.numNodes = numNodes</pre><p>Your initial matrix would look like this (compare it with the diagram below):</p><pre>self.adjacencyMatrix = [[0, 0, 0, 0], <br>                        [0, 0, 0, 0], <br>                        [0, 0, 0, 0], <br>                        [0, 0, 0, 0]]</pre><figure><img alt="" src="https://cdn-images-1.medium.com/max/613/1*5RYc9fftPy7dtbco8AGlIw.png" /><figcaption>Initial matrix.</figcaption></figure><h4>2️⃣ Add Edges</h4><p>Then, you start adding the edges. For example:</p><pre>graph1 = Graph(4)     # Create an instance of the graph with 4 nodes<br>graph1.addEdge(0, 1); # The 0th element is A. The 1st element is B</pre><p>This will execute the method shown below, that assigns the value 1 to the corresponding cell:</p><pre>def addEdge(self, start, end):<br>    self.adjacencyMatrix[start][end] = 1</pre><p>On this line, <strong>self.adjacencyMatrix[start][end] = 1</strong> :</p><ul><li><strong>[start]</strong> selects the <strong>row.</strong></li><li><strong>[end]</strong> selects the <strong>column</strong>.</li><li>Finally, the value 1 is assigned at this position.</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/765/1*-RwIzqbWOHQ0au_U350FBw.png" /></figure><pre>self.adjacencyMatrix = [[0, 1, 0, 0], # 0th row, 1st column.<br>                        [0, 0, 0, 0], <br>                        [0, 0, 0, 0], <br>                        [0, 0, 0, 0]]</pre><p>At this point, our graph would look like the diagram below because we’ve only added the first edge.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/992/1*JcjTUvUV0-yAnK_9LavMFQ.png" /></figure><p><strong>We repeat the process until we’ve added all the edges and our graph looks like this:</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/953/1*MgzhAKe0HCSbk4JFExvcIQ.png" /><figcaption>Adjacency Matrix.</figcaption></figure><h4>3️⃣ Remove Edges</h4><p><strong>You can also remove edges from your graph.</strong> Let’s say that once you’ve set up your matrix, you want to remove the edge between Nodes C and D (shown below).</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/452/1*HmupI5OQR7_riOeZwV79Fw.png" /></figure><p>This method will check if there is an edge between the nodes and, if there is, it will remove it by setting the value to 0.</p><pre>def removeEdge(self, start, end):<br>    if self.adjacencyMatrix[start][end] == 0:<br>        print(&quot;There is no edge between these nodes&quot;)<br>    else:<br>        self.adjacencyMatrix[start][end] = 0</pre><figure><img alt="" src="https://cdn-images-1.medium.com/max/559/1*vqY32KLcHqrV2rRtGDWN0g.png" /><figcaption>The edge was removed.</figcaption></figure><h4>4️⃣ Check if Two Nodes are Connected</h4><p>You can also check if an edge exists by finding the element in the matrix and checking if it’s 0 or 1. If the value of the edge is greater than 0, an edge exists and the method returns True. Otherwise, there is no edge between these nodes and the method returns False.</p><pre>def containsEdge(self, start, end):<br>     if self.adjacencyMatrix[start][end] &gt; 0:<br>         return True<br>     else:<br>         return False</pre><p>Let’s say that you want to check if there is an edge between Nodes B and D.<br>You would call print(graph1.containsEdge(3, 1)) but since the value is 0, there is no edge between these nodes and False is returned.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/516/1*3StmGiIAeHtTCAZRUACqrg.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/556/1*ZbXnizmSpSw60zqCU_bPFA.png" /><figcaption>There is no edge between Nodes B and D.</figcaption></figure><h4>👋 Thank you!</h4><p>I really hope that you liked my article. ❤️<br>I sincerely appreciate your claps and comments.👏<br><strong>Follow me on </strong><a href="https://medium.com/@estefaniacn"><strong>Medium</strong></a> | <a href="https://twitter.com/Estefania_CN_">Twitter</a> to find more articles like this. 😃</p><figure><img alt="" src="https://cdn-images-1.medium.com/proxy/1*kYMkxO_U5b5SQgsQBQr5lA.gif" /></figure><p>If you liked this article, I suggest reading my article on <strong>Linked Lists</strong>:</p><p><a href="https://medium.com/techmacademy/data-structures-101-linked-lists-behind-the-scenes-7a564cecc29f">Data Structures: Linked Lists —  Behind the Scenes Visual Tour</a></p><p>📣 <strong>Stay tuned </strong>for a future article on <strong>Adjacent Lists, </strong>which are optimal<strong> </strong>for sparse graphs (graphs that don’t have many edges).</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=6512493912c0" width="1" height="1" alt=""><hr><p><a href="https://medium.com/techmacademy/graphs-adjacency-matrix-behind-the-scenes-visual-tour-6512493912c0">Graphs: Adjacency Matrices— Behind the Scenes Visual Tour</a> was originally published in <a href="https://medium.com/techmacademy">Techmacademy</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Online Learning: My Top Tips to Succeed — Detailed & Honest!]]></title>
            <link>https://medium.com/@estefaniacn/online-learning-my-top-tips-to-succeed-detailed-honest-d06b9a3cca70?source=rss-61ce348a12bc------2</link>
            <guid isPermaLink="false">https://medium.com/p/d06b9a3cca70</guid>
            <category><![CDATA[learning-to-code]]></category>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[learning]]></category>
            <category><![CDATA[education]]></category>
            <category><![CDATA[online-learning]]></category>
            <dc:creator><![CDATA[Estefania Cassingena Navone]]></dc:creator>
            <pubDate>Tue, 08 Jan 2019 14:31:01 GMT</pubDate>
            <atom:updated>2019-01-08T14:31:01.094Z</atom:updated>
            <content:encoded><![CDATA[<h3>Online Learning: My Top Tips to Succeed — Detailed &amp; Honest!</h3><h4>Top Tips for a Unique Learning Experience.</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/960/0*dM6S8UvFFTnx2Fro.jpg" /></figure><h3>👋 Welcome to the World of Online Learning.</h3><p><strong>Online learning is a truly unique experience and a world of endless knowledge and discovery.</strong> It offers affordable and accessible high-quality content for everyone all around the world. I personally <strong>loved </strong>❤️ online learning from the first moment I took my first online course, and I haven’t stopped ever since.</p><p>If you are reading this article, chances are that you are starting your journey by taking your first course, or perhaps you already have some previous experiences and would like to optimize your habits.</p><p>If this is the case, you’ve come to the right place! 😃👍 Here are my top tips after approximately four years of taking courses on <a href="https://www.edx.org/">edX</a>, <a href="https://ocw.mit.edu/index.htm">MIT OCW</a>, <a href="https://www.uopeople.edu/#">UoPeople</a>, <a href="https://www.udacity.com/">Udacity</a>, <a href="https://www.coursera.org/">Coursera</a>, <a href="https://www.khanacademy.org/">Khan Academy</a>, <a href="https://www.udemy.com/">Udemy</a> and even <a href="https://www.youtube.com/">YouTube</a> (Yes, I’m a huge fan! I found my love for computer science thanks to these platforms 😍).</p><h4>✅ Tip #1: Be Self-Driven and Motivated.</h4><p><strong>Choose courses that you are genuinely interested in.</strong> Online learning is a completely independent experience, and being self-driven and motivated is vital to enjoy the experience.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/340/0*2quJXQQ3fAqvvxhw.jpg" /></figure><p><strong>Before taking a course, ask yourself:</strong></p><ul><li><strong>Do I get really excited when I read the course description?</strong> I usually know from just reading the course description and watching the promo video if I’m interested in what the course offers. Analyze these elements and be honest with yourself. If you don’t feel really excited by reading the syllabus, it may not be the right course for you. But don’t worry, there are thousands of courses out there waiting for you to find them. 😜</li><li><strong>Can I dedicate enough time per week to this course?</strong> Sometimes we get really excited to start a course, but then our lives, schedules and personal circumstances get in the way. Be honest to yourself and determine if you can keep up with the due dates. Some courses may not even have due dates because they are self-paced and you can complete the coursework before a certain deadline without having strict due dates per week. If you are extremely busy, this might be the best way to go. Otherwise, having due dates (at least in my personal opinion 😊) really helps you stay on track and creates a more enjoyable experience.</li><li><strong>Will this course help me in the future? </strong>Analyzing how a course fits within the context of your future and professional career really helps you engage with the coursework. If you know why you’re taking the course, every assignment becomes an opportunity to master the skills that you‘ll need, and every lecture is one more step towards reaching a particular goal. This way, you have that extra encouragement that you need during the ups and downs of your course experience. 👀</li><li><strong>Would I be willing to choose this course over another activity?</strong> When you commit to a course, it is vital to make sure that you are willing to “sacrifice” the time that you would dedicate to doing something else. If you truly enjoy the course, it will not feel like a sacrifice at all, it will feel like an investment for your future. 🏆</li></ul><p><strong>If your answer is yes to all these questions, then you’ve found the right course!</strong> If not, keep searching. There are thousands of online courses out there, so be confident that your perfect course is waiting for you to find it. 👌</p><h4>✅ Tip #2: Develop Time Management Skills.</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/657/0*OdnYtkIpStebTy4b.jpg" /></figure><p>⏰<strong> Time management skills are vital to succeed in online learning. </strong>Unlike traditional classroom settings, online courses will not have a mechanism to constantly remind you of the due dates, so I recommend creating a schedule and a notification system.</p><p>You can install an app on your smartphone or computer and keep track of your due dates, or perhaps use pen and paper and write a to-do list for the week. It’s important to keep your list where you can see it and update it on a daily basis.</p><p><strong>Set a fixed study schedule per week.</strong> I know unexpected things can happen, but this is vital to stay on track and meet your deadlines. You can adjust your specific study hours to fit your needs, but it’s vital to maintain a fixed amount of time per week dedicated to the course. I recommend spreading your work across several days to avoid rushing into learning the content in the last moment.</p><h4>✅ Tip #3: Use All the Resources Available.</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/896/0*oA22HWgkPe300DA_.jpg" /></figure><p>👉<strong> Online learning means freedom.</strong> You can use the resources provided as you wish, and it’s up to you to take full advantage of what each course offers.</p><p><strong>Video lectures, discussion forums, quizzes, practice exercises, PDF handouts, webinars, they are all there for YOU.</strong> 🎓 Yes, some courses may include more resources than others, but each one has its own unique advantages that you can explore to fit your learning style.</p><p>This is why I think online learning is more versatile than traditional learning, because <strong>it can be molded and customized by the student to provide the optimal learning experience</strong>. I’m a visual learner myself, 👀 so I like to watch video lectures, diagrams and colorful explanations, but that’s my personal preference. Online learning gives you the opportunity to customize your experience as you wish.</p><p><strong>You can engage in interesting discussions with your peers on the discussion forums and even ask questions.</strong> ❓ Online learning might feel solitary during moments of frustration and despair when the content gets complicated but discussion forums bring that human element that we all need to overcome hurdles, clarify doubts and exchange ideas. There will always be a peer or instructor willing to help you.</p><p><strong>It’s all there for you, you just need to take the time to determine how to customize it to fit your needs. 👍</strong></p><h4>✅ Tip #4: Take Thorough Notes.</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/575/0*CqGqiEk1pRMH7zl2.jpg" /></figure><p><strong>Taking notes is one of the most effective methods to learn during online courses </strong>(in my opinion! 😊). Take thorough notes while you are watching video lectures. Don’t just copy what’s in the slide, truly customize your notes, add small comments, tips that the professor mentions, and things that you found interesting.</p><p>Once you have your notes organized, you can even summarize the topic using mind maps (a technique that I found very effective! 😃).</p><p>Go through the practice exercises after completing them and write down your mistakes. <strong>Don’t think of them as failures, think of them as opportunities to learn and improve</strong>. Add small notes on what you did wrong and how you can fix it. I’ve found this technique very helpful to review before quizzes and graded exams.</p><p><strong>The key is to find a method that works for you and that helps you understand the topic well enough to apply it to new scenarios. 👍</strong></p><h4>✅ Tip #5: Dive Deeper into Each Topic.</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/504/0*e_ZPlAkGM-rRud27.jpg" /></figure><p><strong>With freedom, comes responsibility.</strong> You now have thousands of years of wisdom and billions of resources at your disposal with just one click. It is your responsibility to take full advantage of the amazing tools that the 21st century provides. 📚</p><p><strong>You are not limited to restricting your knowledge to what’s provided in the course.</strong> Dive deeper into each topic, find external resources, make a Google Search on the topic you are studying and start your journey to a world of endless knowledge. Browse through forums, articles, news, journals, anything that can complement what you’re studying to add context to your learning process.</p><p><strong>In online learning, you are in charge of how much you learn. </strong>You get what you give. If you work hard and dedicate time and effort, you will be rewarded with an awesome learning experience and new knowledge that you can apply to your daily life and work.</p><p><strong>These are my top tips for succeeding as an online learner. I really hope you liked this article, and I wish you good luck with your journey. 👍</strong></p><h3>👋 Thank you for reading my article!</h3><p><strong>I really appreciate your claps </strong>👏👏👏 if you liked it and you would like to see more! 😃</p><p>👉 Follow my publication <strong>Techmacademy </strong>on <a href="https://medium.com/techmacademy">Medium</a> | <a href="https://twitter.com/techmacademy">Twitter</a> 👈</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/600/1*kYMkxO_U5b5SQgsQBQr5lA.gif" /></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=d06b9a3cca70" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Data Structures: Linked Lists —  Behind the Scenes Visual Tour]]></title>
            <link>https://medium.com/techmacademy/data-structures-101-linked-lists-behind-the-scenes-7a564cecc29f?source=rss-61ce348a12bc------2</link>
            <guid isPermaLink="false">https://medium.com/p/7a564cecc29f</guid>
            <category><![CDATA[computer-science]]></category>
            <category><![CDATA[data-structures]]></category>
            <category><![CDATA[learning-to-code]]></category>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[programming]]></category>
            <dc:creator><![CDATA[Estefania Cassingena Navone]]></dc:creator>
            <pubDate>Mon, 07 Jan 2019 14:01:10 GMT</pubDate>
            <atom:updated>2019-01-17T17:22:48.079Z</atom:updated>
            <content:encoded><![CDATA[<h3>Data Structures: Linked Lists — Behind the Scenes Visual Tour</h3><h4>Powerful Data Structures for Developers.</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*KUouAp6uuYfW7ibQwLadbA.png" /></figure><h3>👋 Meet Linked Lists!</h3><p>Welcome to the world of Linked Lists! These are awesome data structures that waste no memory and let you <strong>add and remove nodes extremely efficiently</strong> from the <strong>beginning </strong>and <strong>end </strong>of the list.</p><p><strong>Sounds exciting, right? Let’s begin! 🎆</strong></p><h4>✅ The Building-Blocks</h4><p>The basic building-blocks of a linked list are:</p><ul><li><strong>Nodes: </strong>they represent the elements stored in the list. You can create Nodes using Object-Oriented Programming. First, you need to define a Node class and then create an instance for each Node that you want to include in the linked list.</li></ul><iframe src="" width="0" height="0" frameborder="0" scrolling="no"><a href="https://medium.com/media/aa6de8feabbe5dd907002f93b46bcd32/href">https://medium.com/media/aa6de8feabbe5dd907002f93b46bcd32/href</a></iframe><ul><li><strong>Links Between Nodes Via Pointers:</strong> one the main characteristics of Linked Lists is that Nodes are connected via pointers. Each node stores a reference to its “neighbors” so they can be accessed easily and sequentially.</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1005/1*w2N5vDcVO5NNZsFNWWyKLA.png" /><figcaption>Without pointers, nodes are not connected.</figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*GbWzQHhtareNye3KFnBmQQ.png" /><figcaption>Pointers create the magic of linked lists.</figcaption></figure><p>For example, in the Linked List shown above, the green node in the middle would have these two attributes (defined in the Node class):</p><pre><strong>self.next # Pointer to the right node (next node)(blue node)<br>self.prev # Pointer to the left node (previous node)(purple node)</strong></pre><p>💡 <strong>Note:</strong> Using Python, the <strong>HEAD</strong> node would have None as self.prev because since it’s the first node in the list, it doesn’t have a node located immediately to its left. Similarly, the <strong>TAIL</strong> node would have None as self.next because it doesn’t have a node located immediately to its right.</p><p>This way, you can go from one node to another (traverse the list) using the pointers that connect them until you find the node that you are looking for.</p><h4>✅ Advantages of Linked Lists 😃</h4><ul><li>It takes <strong>constant time</strong> ❤️ <strong>O(1)</strong> to <strong>insert </strong>or <strong>remove </strong>elements at the <strong>beginning</strong> and <strong>end </strong>of the list. This means that even if the list gets really large, the time required to perform these operations will not increase! 🎆</li><li><strong>No memory is wasted</strong>, in contrast with Arrays in which memory is allocated even before storing new data causing it to be underutilized until it’s full. With Linked Lists, you create nodes dynamically when they are needed and only rearrange the pointers to update the data structure.</li></ul><h4>✅ Disadvantages of Linked Lists 😢</h4><ul><li>It takes<strong> linear time </strong>💔 <strong>O(n)</strong> to <strong>find </strong>an element (even if the list is sorted) because the elements are not stored contiguously in memory; therefore, you need to <strong>go through the list sequentially</strong> until you find the element you are looking for or reach the end of the list if the element doesn&#39;t exist.</li></ul><h4>✅ Types of Linked Lists</h4><ul><li><strong>Singly-Linked Lists: </strong>In this type of Linked List, nodes only have a pointer pointing to the node that is located <strong>immediately to their right (notice the arrows in the diagram below)</strong>. Therefore, the list can only be traversed (read) in <strong>ONE </strong>direction.</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/880/1*m9XaAp_d-Ig3TJPbMqH2Qw.png" /></figure><ul><li><strong>Doubly-Linked Lists: </strong>In this type of Linked List, nodes have pointers to the nodes located <strong>immediately to their left (before) and to their right (after)</strong>. Therefore, the list can be traversed in <strong>BOTH </strong>directions, starting from <strong>HEAD </strong>or from <strong>TAIL</strong>.</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/857/1*96fjK_cCdDdfnvqKEfwBRw.png" /></figure><h4>✅ Linked List Attributes</h4><p>You should keep a reference to the head and tail nodes in your LinkedList class to insert new nodes very efficiently at these positions.</p><pre><strong>class LinkedList(object):<br>      def __init__(self):<br>           self.head = None</strong> // Keep a reference to the <strong>HEAD </strong>node<strong><br>           self.tail = None </strong>// Keep a reference to the <strong>TAIL</strong> node</pre><h4>✅ Inserting a Node</h4><p>How would you insert a node into a linked list? Let’s see the logic in detail!</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1007/1*ogM7GptwCcaP83oodoSwDg.png" /><figcaption>Inserting?</figcaption></figure><h4><strong>There are three cases for insertion:</strong></h4><ul><li><strong>HEAD: </strong>Make the new node the <strong>HEAD</strong> node by rearranging the pointers.</li><li><strong>TAIL: </strong>Make the new node the <strong>TAIL</strong> node by rearranging the pointers.</li><li><strong>Middle: </strong>Traverse the list until you reach the node that will become the <strong>PREVIOUS </strong>node after the insertion (you will see why in the diagrams below) and then update the necessary pointers.</li></ul><h4><strong>Update the Pointers:</strong></h4><p>Let’s say that you want to insert a node at index 2 of a doubly-linked list. See the diagrams below as you read the explanation to have a visual intuition of the process 👍.</p><ul><li>First, you reach the node at index 1 (green node) using the existing pointers. This is the node that is located immediately <strong>before the insertion site.</strong></li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1007/1*ogM7GptwCcaP83oodoSwDg.png" /><figcaption>Step 1. Reach the previous node (index 1, green node).</figcaption></figure><ul><li>Then, you start updating the pointers. You will need to use the existing pointers from the green node, so let’s see this in more detail!</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1005/1*OeFBqCcmRlajt2J8YU_XWA.png" /><figcaption>Step 2</figcaption></figure><h4>1️⃣ New Node</h4><ul><li>The blue node used to be self.next for the green node because they were directly connected. But now the blue node will be self.next for the new node (yellow node) because it will be located immediately to its right. The green node will no longer be directly connected to the blue node after the insertion.</li><li>The green node will now be self.prev for the new node (yellow node) because after the insertion, the green node will be located immediately to the left of the yellow node (see the diagram below).</li></ul><h4>2️⃣ Green Node</h4><ul><li>You will also need to update the pointers of the green node. self.next for this node will now be the new node (yellow) because it will be located immediately to its right.</li></ul><h4>3️⃣ Blue Node</h4><ul><li>Finally, self.prev for the blue node must be updated to point to the new node (yellow node) because the yellow node will now be immediately to its left.</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1006/1*tZd_MAOgPxi-vE6UVsu5wA.png" /><figcaption>Final Linked List After Insertion</figcaption></figure><h4>✅ Finding an Element</h4><p>To find an element, you start from the <strong>HEAD </strong>node and compare the <strong>value </strong>of each node with the value that you want to find until you reach the node you seek or until you reach the <strong>TAIL </strong>node and return a specific value that you define to indicate that the element was not found.</p><p>💡<strong> Note:</strong> If you have a doubly-linked list, like in the diagrams above, you can start from the <strong>TAIL</strong> as well and traverse the list until you reach <strong>HEAD</strong>.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/996/1*Xm3o3qjDrdRXkJDxyxSidQ.png" /><figcaption>Diagram of the Process of Finding an Element in a Singly-Linked List</figcaption></figure><h4>✅ Removing an Element</h4><p>To remove an element, you first reach the index that is located immediately before the deletion site. Let’s see how we can remove the node at index 2 in the diagram below. 👍</p><h4>👉 Rearranging Pointers</h4><ul><li>self.next for the green node will now point to the yellow node because we are removing the blue node that is in between.</li><li>self.prev for the yellow node needs to be updated to point to the green node as well.</li><li>This way, as you can see in the diagrams below, the blue node is no longer connected to the Linked List and was successfully removed!</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/1008/1*zhlTQib5mlFtaSGY7i6zow.png" /><figcaption>Original Linked List.</figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/999/1*HHid9eSJ9erLtw91RCijJw.png" /><figcaption>Rearranging Pointers.</figcaption></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/1001/1*i1lvEJkOYjl4A_FckYB4JQ.png" /><figcaption>Final Linked List After Removal.</figcaption></figure><p>💡<strong> Note: </strong>You will need to make sure that the node that you just removed is also removed from memory; otherwise, it could cause a memory leak because you are only rearranging the pointers to remove it from the data structure. We are not actually deleting the node itself, we are “isolating” it from the data structure so it won’t be accessed when the list is traversed (read).</p><h4>✅ Last, But Not Least… Linked Lists in Context!😉</h4><p>❤️ <strong>Data Structures are really awesome.</strong> You want to use Linked Lists for operations that require inserting and/or removing from the end and/or start of the list.</p><p>Each data structure has unique advantages and disadvantages, and you need choose the appropriate one(s) for your project. For example, <strong>Doubly-Linked Lists are used to implement Double-Ended Queues or Deques</strong> (used to implement <strong>Stacks </strong>and <strong>Queues</strong>). They use the advantages that Linked Lists provide: constant-time insertion and deletion operations at the start and end of the list.</p><p>Here are some interesting discussions on the applications of Linked Lists:</p><ul><li><a href="https://www.quora.com/When-would-you-use-a-linked-list">When would you use a linked list?</a> — Quora</li><li><a href="https://www.quora.com/In-which-cases-should-I-prefer-a-linked-list-over-any-other-data-structure">In which cases should I prefer a linked list over any other data structure? </a>— Quora</li><li><a href="https://www.quora.com/What-is-an-application-of-linear-linked-list-data-structures">What is an application of linear linked list data structures? </a>— Quora</li></ul><p>Keep exploring these awesome data structures and dive deeper into the wonderful world of computer science! 😍</p><h4>👋 Thank you for reading my article!</h4><p><strong>I really appreciate your claps </strong>👏👏👏 if you liked my article and you would like to see more! 😃 Follow <strong>Techmacademy</strong> on <a href="https://medium.com/techmacademy">Medium</a> | <a href="https://twitter.com/techmacademy">Twitter</a></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/600/1*kYMkxO_U5b5SQgsQBQr5lA.gif" /></figure><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=7a564cecc29f" width="1" height="1" alt=""><hr><p><a href="https://medium.com/techmacademy/data-structures-101-linked-lists-behind-the-scenes-7a564cecc29f">Data Structures: Linked Lists —  Behind the Scenes Visual Tour</a> was originally published in <a href="https://medium.com/techmacademy">Techmacademy</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Add Vector Icons To Your Websites — Behind The Scenes Walkthrough!]]></title>
            <link>https://codeburst.io/add-vector-icons-to-your-websites-behind-the-scenes-walkthrough-8fee608ad5ff?source=rss-61ce348a12bc------2</link>
            <guid isPermaLink="false">https://medium.com/p/8fee608ad5ff</guid>
            <category><![CDATA[computer-science]]></category>
            <category><![CDATA[web-development]]></category>
            <category><![CDATA[web-design]]></category>
            <category><![CDATA[development]]></category>
            <category><![CDATA[programming]]></category>
            <dc:creator><![CDATA[Estefania Cassingena Navone]]></dc:creator>
            <pubDate>Tue, 11 Sep 2018 14:11:02 GMT</pubDate>
            <atom:updated>2018-09-12T15:04:26.170Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*DCh8MaSIqssogIGQm3boEg.png" /></figure><p>Icons make your products look awesome and they add the professional touch you need to impress your users. They do not stretch or change when the screen is resized which makes them perfect for responsive websites.</p><p>In this article you will learn how to add them to your websites, how to customize them and how to make them clickable.</p><p><strong>Let’s begin! 👍</strong></p><h3>💻 Meet Font Awesome!</h3><p>The first step is to find the vector icon(s) you want to add. I really recommend <a href="https://fontawesome.com/free">Font Awesome</a>’s free icons ❤️.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*9mIYJEsMa7iq90WaD4BOlw.png" /></figure><p>💡 <strong>Note:</strong> To start using Font Awesome, <a href="https://fontawesome.com/how-to-use/on-the-web/setup/getting-started?using=web-fonts-with-css">you need to include this tag in your HTML </a><a href="https://fontawesome.com/how-to-use/on-the-web/setup/getting-started?using=web-fonts-with-css">&lt;head&gt; tag</a>.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*isAqJWNvemfhU-ktkjlGUA.png" /></figure><pre>&lt;link rel=&quot;stylesheet&quot; href=&quot;https://use.fontawesome.com/releases/v5.3.1/css/all.css&quot; integrity=&quot;sha384-mzrmE5qonljUremFsqc01SB46JvROS7bZs3IO2EmfFsd15uHvIt+Y8vEf7N7fWAU&quot; crossorigin=&quot;anonymous&quot;&gt;</pre><h3>✅ Add the Icon!</h3><p><a href="https://fontawesome.com/icons?d=gallery&amp;m=free">Explore their free catalog</a> and select the icon(s) you want to use. 👍</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*ju4SbR2LXpqpvrwjL--1iw.png" /></figure><p>Select a specific icon to see its variations:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*relAzw4KrR0hBxgFy0igJw.png" /></figure><p>Within your <strong>&lt;body&gt;</strong> tag, copy and paste this <strong>&lt;i&gt;</strong> tag that you will find at the bottom of the icon’s details:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/449/1*bvtr7uJbqeSLoaoK-M19rA.png" /></figure><p>Here is an example of how you could add three icons to a footer:</p><pre>&lt;footer&gt;<strong><br> &lt;i class=&quot;fab fa-twitter&quot;&gt;&lt;/i&gt;<br> &lt;i class=&quot;fab fa-facebook-square&quot;&gt;&lt;/i&gt;<br> &lt;i class=&quot;fab fa-instagram&quot;&gt;&lt;/i&gt;<br></strong>&lt;/footer&gt;</pre><p>🎆 You can see how the icons are now displayed on your website! 🎆</p><p><strong>Awesome job! </strong>👍</p><h3>🎨 Customize your Icons!</h3><p>Vector icons act like fonts. To customize them, you need to change the text color and/or size.</p><ul><li>To customize their <strong>size</strong>, change the <strong>font-size</strong> property.</li><li>To customize their <strong>color</strong>, change the <strong>color</strong> property.</li></ul><figure><img alt="" src="https://cdn-images-1.medium.com/max/202/1*69Mx0MTm-8NUEPMGHBTXDg.png" /><figcaption>Sample Customized Icons</figcaption></figure><p>💡 <strong>Note:</strong> If you use Font Awesome, to customize <strong>all icons</strong> you can use the <strong>.fab</strong> CSS selector, and to customize <strong>individual icons</strong> you can use the <strong>.fa-&lt;icon_description&gt; </strong>selector. They are both included in the <strong>&lt;i&gt; </strong>tag.</p><h3>🔵 Add a Rounded Background!</h3><p>If you want your icons to have these nice rounded backgrounds, you need to customize your CSS ever further.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/210/1*1EMeFtn3jC0ysoA9QgwAmg.png" /><figcaption>Sample Rounded Backgrounds</figcaption></figure><ul><li><strong>Add Padding and/or Margin</strong>. Depending on your purpose, this can be a great strategy to create this nice background with a contrasting color.</li><li><strong>Set the </strong><a href="https://www.w3schools.com/cssref/css3_pr_border-radius.asp"><strong>border-radius</strong></a><strong> property to 100%. </strong>This creates a rounded shape around the icons.</li><li><strong>Set the </strong><strong>background-color property to a contrasting color.</strong></li><li><strong>Set a very subtle </strong><strong>border property </strong>(Optional)<strong>.</strong></li></ul><h3>👀 Example!</h3><p>This is an example of these customized icons in a very simple footer:</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fcodepen.io%2FEstefaniaC%2Fembed%2Fpreview%2FOoQvrB%3Fheight%3D600%26slug-hash%3DOoQvrB%26default-tabs%3Dcss%2Cresult%26host%3Dhttps%3A%2F%2Fcodepen.io%26embed-version%3D2&amp;url=https%3A%2F%2Fcodepen.io%2FEstefaniaC%2Fpen%2FOoQvrB&amp;image=https%3A%2F%2Fs3-us-west-2.amazonaws.com%2Fi.cdpn.io%2F1256786.OoQvrB.small.c918b20f-f790-4ad8-999f-ca078048bbe9.png&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=codepen" width="800" height="600" frameborder="0" scrolling="no"><a href="https://medium.com/media/899dbef5d1fc5c8155ba0ae1bfa3f7ff/href">https://medium.com/media/899dbef5d1fc5c8155ba0ae1bfa3f7ff/href</a></iframe><h3>🔧 Make Your Icons Clickable</h3><p>You can make your icons clickable by replacing the <strong>&lt;i&gt;</strong> tag with an <strong>&lt;a&gt;</strong> tag:</p><pre><strong>&lt;a class=&quot;fab fa-twitter&quot; href=&quot;https://medium.com/&quot; target=&quot;_blank&quot;&gt;&lt;/a&gt;</strong></pre><p><strong>You keep the same </strong><strong>fab fa-&lt;icon_description&gt; classes but change:</strong></p><ul><li>The <strong>&lt;i&gt;</strong> tag to an <strong>&lt;a&gt;</strong> tag.</li><li>Add an <strong>href </strong>attribute with the destination URL.</li><li>You can add <strong>target= “_blank”</strong> to open the link in a new tab (optional).</li></ul><p>💡 <strong>Note:</strong> You will need to add <strong>text-decoration: none; </strong>to your <strong>.fab</strong> CSS selector since <strong>&lt;a&gt;</strong> tags are are underlined by default.</p><p>Here you can see an example of clickable vector icons:</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fcodepen.io%2FEstefaniaC%2Fembed%2Fpreview%2FwEmGQd%3Fheight%3D600%26slug-hash%3DwEmGQd%26default-tabs%3Dcss%2Cresult%26host%3Dhttps%3A%2F%2Fcodepen.io%26embed-version%3D2&amp;url=https%3A%2F%2Fcodepen.io%2FEstefaniaC%2Fpen%2FwEmGQd&amp;image=https%3A%2F%2Fs3-us-west-2.amazonaws.com%2Fm.cdpn.io%2Fscreenshot-coming-soon-small.png&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=codepen" width="800" height="600" frameborder="0" scrolling="no"><a href="https://medium.com/media/7bbf1d768c8668e722ec03c3b38dd228/href">https://medium.com/media/7bbf1d768c8668e722ec03c3b38dd228/href</a></iframe><p>Feel free to browse through the HTML and CSS on these examples and start incorporating vector icons to your own products and websites. 🎊</p><p><strong>I really hope you found this article helpful and I sincerely appreciate your claps. 👏 👍</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/600/1*kYMkxO_U5b5SQgsQBQr5lA.gif" /></figure><p><a href="https://medium.com/@estefaniacn"><strong>Follow me on Medium</strong></a><strong> 😃.</strong></p><figure><a href="http://bit.ly/codeburst"><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*i3hPOj27LTt0ZPn5TQuhZg.png" /></a></figure><blockquote>✉️ <em>Subscribe to </em>CodeBurst’s<em> once-weekly </em><a href="http://bit.ly/codeburst-email"><strong><em>Email Blast</em></strong></a><strong><em>, </em></strong>🐦 <em>Follow </em>CodeBurst<em> on </em><a href="http://bit.ly/codeburst-twitter"><strong><em>Twitter</em></strong></a><em>, view </em>🗺️ <a href="http://bit.ly/2018-web-dev-roadmap"><strong><em>The 2018 Web Developer Roadmap</em></strong></a><em>, and </em>🕸️ <a href="http://bit.ly/learn-web-dev-codeburst"><strong><em>Learn Full Stack Web Development</em></strong></a><em>.</em></blockquote><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=8fee608ad5ff" width="1" height="1" alt=""><hr><p><a href="https://codeburst.io/add-vector-icons-to-your-websites-behind-the-scenes-walkthrough-8fee608ad5ff">Add Vector Icons To Your Websites — Behind The Scenes Walkthrough!</a> was originally published in <a href="https://codeburst.io/">codeburst</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Google Fonts for Web Developers: Add Custom Fonts to your Website!]]></title>
            <link>https://codeburst.io/intro-to-google-fonts-for-web-developers-5559b63807d3?source=rss-61ce348a12bc------2</link>
            <guid isPermaLink="false">https://medium.com/p/5559b63807d3</guid>
            <category><![CDATA[development]]></category>
            <category><![CDATA[learning-to-code]]></category>
            <category><![CDATA[web-design]]></category>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[web-development]]></category>
            <dc:creator><![CDATA[Estefania Cassingena Navone]]></dc:creator>
            <pubDate>Sun, 02 Sep 2018 17:44:40 GMT</pubDate>
            <atom:updated>2018-09-04T15:12:21.980Z</atom:updated>
            <content:encoded><![CDATA[<p>Are you amazed by the incredible variety of beautiful fonts you find all over the web? Learn how you can incorporate them into your own websites with <strong>Google Fonts</strong>!</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/800/1*yY2b5cLeTHSAXDTjww81ig.png" /><figcaption>Sample Google Fonts</figcaption></figure><h3>✅<strong> Our Project</strong>:</h3><p>You’ll learn how you can customize this text using <strong>Google Fonts</strong>! Are you ready? Let’s begin! 👍</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fcodepen.io%2FEstefaniaC%2Fembed%2Fpreview%2FjvBvzj%3Fheight%3D600%26slug-hash%3DjvBvzj%26default-tabs%3Dcss%2Cresult%26host%3Dhttps%3A%2F%2Fcodepen.io%26embed-version%3D2&amp;url=https%3A%2F%2Fcodepen.io%2FEstefaniaC%2Fpen%2FjvBvzj&amp;image=https%3A%2F%2Fs3-us-west-2.amazonaws.com%2Fm.cdpn.io%2Fscreenshot-coming-soon-small.png&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=codepen" width="800" height="600" frameborder="0" scrolling="no"><a href="https://medium.com/media/a3cc0e3a71e93b49950fb2646392b192/href">https://medium.com/media/a3cc0e3a71e93b49950fb2646392b192/href</a></iframe><h3><strong>👋 Meet the Google Fonts Website</strong></h3><p>First you must go to <a href="https://fonts.google.com/"><strong>Google Fonts</strong></a>. You will see a wide variety to choose from.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*wecxjzh8p1oEhd4NUBu_Eg.gif" /><figcaption>Google Fonts Website</figcaption></figure><h4>✏️ Write your Custom Text</h4><p>You can type your custom text into a specific box to see what that font looks like and customize it! 👍</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/485/1*ojUzG1EkMIGOAzl9lkntfQ.gif" /></figure><p><strong>💡 Note: </strong>If you click “<strong>Apply to All Fonts</strong>” this custom text will be updated and displayed in all the previews.</p><h3>🔎 Filters</h3><p>And you can filter fonts by <strong>categories</strong>, <strong>thickness</strong>, <strong>width</strong> and much more with this panel:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*t2mwwkqWP1wxDPn_dK_Dbg.gif" /><figcaption>Filter by Category</figcaption></figure><h3>✔️<strong> Select your Font(s)</strong></h3><p>When you find a font that want to incorporate into your website, you can select it by clicking the <strong>+</strong> button.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/479/1*dSOWc025ZrMRiDcX7Yi_kg.gif" /></figure><p>💡 <strong>Note:</strong> This small menu will pop up at the bottom of the screen. You can select more fonts and they will be added as well.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/761/1*JjPoMr7HEWS5mCpCyHv6Fw.gif" /></figure><h3>➕<strong> Add Custom Font(s) to your Website</strong></h3><p>If you click on the pop up menu at the bottom of the screen, you will see this:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/751/1*roTtXKZmInBZI6_waFsMew.gif" /></figure><h4>Steps</h4><ul><li>Copy/paste the <strong>&lt;link&gt;</strong> tag displayed in the <strong>“Embed Font” </strong>section into your HTML <strong>&lt;head&gt;</strong> tag.</li><li>Then, on your <strong>CSS</strong> stylesheet add the line displayed in the <strong>“Specify in CSS”</strong> section to the class or selector that corresponds to your text.</li></ul><p><strong>This is the basic structure for this CSS attribute:</strong></p><pre><strong>font-family: &#39;&lt;custom_font_you_selected&gt;&#39;, &lt;fallback_font&gt;</strong></pre><p>💡<strong> Note:</strong> The <strong>second</strong> font is a fallback default font that will be displayed in case the custom font doesn’t load correctly.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/432/1*hXX0Xb7IUDjX60qTC5dz_w.gif" /></figure><h3><strong>👀 Now in Codepen!</strong></h3><p>This is what our text looks like after adding <strong>Google Fonts</strong>. 😃 Feel free to browse through the pen and check the HTML, CSS and options.</p><p>In CodePen, the <strong>&lt;link&gt;</strong> tag is added in <strong>Settings &gt; HTML &gt; Stuff for &lt;head&gt;</strong>.</p><iframe src="https://cdn.embedly.com/widgets/media.html?src=https%3A%2F%2Fcodepen.io%2FEstefaniaC%2Fembed%2Fpreview%2FjvBvzj%3Fheight%3D600%26slug-hash%3DjvBvzj%26default-tabs%3Dcss%2Cresult%26host%3Dhttps%3A%2F%2Fcodepen.io%26embed-version%3D2&amp;url=https%3A%2F%2Fcodepen.io%2FEstefaniaC%2Fpen%2FjvBvzj&amp;image=https%3A%2F%2Fs3-us-west-2.amazonaws.com%2Fm.cdpn.io%2Fscreenshot-coming-soon-small.png&amp;key=a19fcc184b9711e1b4764040d3dc5c07&amp;type=text%2Fhtml&amp;schema=codepen" width="800" height="600" frameborder="0" scrolling="no"><a href="https://medium.com/media/a3cc0e3a71e93b49950fb2646392b192/href">https://medium.com/media/a3cc0e3a71e93b49950fb2646392b192/href</a></iframe><h3><strong>👏 Great Job!</strong></h3><p>Now you can customize the fonts in your website! 😃 🎆 👍</p><p><strong>If you found this article helpful, your claps are really appreciated ❤️</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/600/1*kYMkxO_U5b5SQgsQBQr5lA.gif" /></figure><p>I would love to read your comments and thoughts.</p><p><a href="https://medium.com/@estefaniacn">Follow me on Medium</a> 😃</p><figure><a href="http://bit.ly/codeburst"><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*i3hPOj27LTt0ZPn5TQuhZg.png" /></a></figure><blockquote>✉️ <em>Subscribe to </em>CodeBurst’s<em> once-weekly </em><a href="http://bit.ly/codeburst-email"><strong><em>Email Blast</em></strong></a><strong><em>, </em></strong>🐦 <em>Follow </em>CodeBurst<em> on </em><a href="http://bit.ly/codeburst-twitter"><strong><em>Twitter</em></strong></a><em>, view </em>🗺️ <a href="http://bit.ly/2018-web-dev-roadmap"><strong><em>The 2018 Web Developer Roadmap</em></strong></a><em>, and </em>🕸️ <a href="http://bit.ly/learn-web-dev-codeburst"><strong><em>Learn Full Stack Web Development</em></strong></a><em>.</em></blockquote><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=5559b63807d3" width="1" height="1" alt=""><hr><p><a href="https://codeburst.io/intro-to-google-fonts-for-web-developers-5559b63807d3">Google Fonts for Web Developers: Add Custom Fonts to your Website!</a> was originally published in <a href="https://codeburst.io/">codeburst</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Meet GitHub & Unlock your True Power as a Developer!]]></title>
            <link>https://medium.com/techmacademy/meet-github-unlock-your-true-power-as-a-developer-674ac0179157?source=rss-61ce348a12bc------2</link>
            <guid isPermaLink="false">https://medium.com/p/674ac0179157</guid>
            <category><![CDATA[learning-to-code]]></category>
            <category><![CDATA[technology]]></category>
            <category><![CDATA[git]]></category>
            <category><![CDATA[github]]></category>
            <category><![CDATA[version-control]]></category>
            <dc:creator><![CDATA[Estefania Cassingena Navone]]></dc:creator>
            <pubDate>Sat, 18 Aug 2018 17:14:57 GMT</pubDate>
            <atom:updated>2018-08-18T17:15:27.660Z</atom:updated>
            <content:encoded><![CDATA[<p>If you are learning how to code and you dream of collaborating with other developers, GitHub is your path to making your dream come true!</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/750/1*2Pf6pfEK6WN7N8_TuoAOcg.png" /></figure><h3>✨ Why GitHub?</h3><p><strong>You may ask: what is GitHub and why is it so powerful?</strong></p><h4>📚 Let’s See This in More Detail:</h4><p>When you are introduced to version control, you start learning &amp; working with git to store different versions of your project in your computer (<strong>locally).</strong></p><p>The power of git is truly amazing: you can create commits, branches and much more, <strong>but… there is something missing, don’t you think?</strong></p><p><strong>How is it possible that developers can collaborate remotely, across the world if git only stores your repositories locally in your computer?</strong></p><p>How can everyone in the team have access to the project?</p><h3><strong>🔥 This is where GitHub comes to the rescue!</strong></h3><p>If you create an account on <a href="http://github.com/">GitHub.com</a> and start working with the wonderful features they offer, <strong>your world as a developer will change</strong>, let’s see why:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/881/1*V5wePLyvwk7vIVEIx-83ZA.png" /><figcaption>GitHub Workflow</figcaption></figure><h4>🔧 Basic Workflow</h4><p>To start working with GitHub, you:</p><ul><li><strong>Create a repository</strong> using git.</li><li>You <strong>send it to a remote repository that you create on your GitHub account </strong>with all your commits, files &amp; branches.</li><li>Then <strong>other developers can contribute</strong> to your project by downloading the entire repository to their computers.</li><li><strong>They submit changes</strong> directly to your remote repository on GitHub’s website.</li><li><strong>And you can then import those changes </strong>to your computer and start the process again, sending new changes to GitHub!</li></ul><p><strong>This is how collaboration truly unlocks! Amazing, right? ⭐️</strong></p><h3>🙌 Collaborate &amp; Find Interesting Projects!</h3><p>You can collaborate to existing open source projects and find an initiative that really creates that wonderful spark in your soul to remind you that you are on the right track by helping a cause that you really cherish.</p><h3>👍 You’re on the Right Path</h3><p><strong>By learning programming and software development you really broaden your horizons beyond borders and limitations.</strong></p><p>You reach out to a world that really needs collaborators who are passionate about projects that can transform societies.</p><p><strong>Start learning GitHub now and be part of this amazing platform with my online course:</strong></p><p><a href="https://www.udemy.com/the-complete-github-course-for-developers/?couponCode=LEARN_GITHUB">Master GitHub in 2 Hours - Work on Real Projects!</a></p><p><strong>I really look forward to having you in the course. 😃 👍</strong></p><h3>👋 Now…</h3><p><strong>I would like to personally invite you to </strong><a href="https://medium.com/techmacademy"><strong>follow Techmacademy</strong></a><strong> </strong>to find articles specially written for awesome learners like you.</p><p><strong>If you found this article helpful, your claps are very much appreciated to help others who are embarking on this journey.</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/600/1*kYMkxO_U5b5SQgsQBQr5lA.gif" /></figure><p>I would love to read your comments and thoughts.</p><p><a href="https://medium.com/@estefaniacn">Follow me on Medium</a> 😃 👍</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=674ac0179157" width="1" height="1" alt=""><hr><p><a href="https://medium.com/techmacademy/meet-github-unlock-your-true-power-as-a-developer-674ac0179157">Meet GitHub &amp; Unlock your True Power as a Developer!</a> was originally published in <a href="https://medium.com/techmacademy">Techmacademy</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[String Templates in Kotlin: Behind the Scenes!]]></title>
            <link>https://medium.com/techmacademy/string-templates-in-kotlin-behind-the-scenes-4c874a3d63b1?source=rss-61ce348a12bc------2</link>
            <guid isPermaLink="false">https://medium.com/p/4c874a3d63b1</guid>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[kotlin]]></category>
            <category><![CDATA[learning-to-code]]></category>
            <category><![CDATA[tech]]></category>
            <category><![CDATA[technology]]></category>
            <dc:creator><![CDATA[Estefania Cassingena Navone]]></dc:creator>
            <pubDate>Mon, 13 Aug 2018 03:01:00 GMT</pubDate>
            <atom:updated>2018-08-13T03:01:00.960Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*bF9SWcqskLi6wi7sIWCMWA.png" /></figure><h3>📃 Meet Templates!</h3><p>Let’s learn an awesome feature that Kotlin incorporates, String Templates! We can assign dynamic values directly into our strings and print statements in Kotlin using templates.</p><p>But what are templates? They are a<strong> special syntax in Kotlin used to incorporate variables and expressions into a string</strong> so it can be updated dynamically as your code is executed.</p><p><strong>Let’s check it out!</strong></p><h3>📦 Variables</h3><p>The syntax used to incorporate a variable into a string is a <strong>$</strong> followed by the name of the variable.</p><pre><strong>$&lt;variable&gt;</strong></pre><p>For Example:</p><pre><strong>var numZebras : Int = 10</strong></pre><pre><strong>println(“The number of Zebras is: $numZebras”) </strong>// Notice the Syntax</pre><p>In this example we insert the value of the variable <strong>numZebras </strong>in the print statement so this is the final string that will be printed:</p><pre><strong>The number of Zebras is: 10</strong></pre><h3>💥 Including Expressions</h3><p>The result of an expression can also be incorporated into a string by using a <strong>$</strong> followed by <strong>{}</strong> and the expression inside the curly braces.</p><pre><strong>var numAdultZebras : Int = 15<br>var numBabyZebras : Int = 5</strong></pre><pre><strong>println(“The total number of Zebras is: <br>${ numAdultZebras + numBabyZebras }) </strong>// Notice the syntax</pre><p>We add the two variables inside the curly braces:</p><pre><strong>${ numAdultZebras + numBabyZebras }</strong></pre><p>and this will be printed, the result replaces the expression:</p><pre><strong>The total number of Zebras is: 20</strong></pre><h3>🔥 More Complex Expressions</h3><p>You can use more complex expressions inside the curly braces such as if statements:</p><pre><strong>println(&quot;The number of Zebras is greater than 5: <br>${if (numZebras &gt; 5) true else false}&quot;) </strong>// Notice the if statement</pre><p>We have this expression:</p><pre><strong>${if (numZebras &gt; 5) true else false}</strong></pre><p>It will return <strong>true</strong> if the number of zebras is greater than 5 and <strong>false</strong> otherwise.</p><p>This will print:</p><pre><strong>The number is Zebras is greater than 5: true</strong></pre><p>As you can see, Kotlin provides much more flexibility than java to print strings and to make our daily work easier by improving our workflow and debugging process. <strong>Kotlin String Templates are Awesome! 👍</strong></p><h3>📚Learn More About String Templates &amp; Kotlin!</h3><ul><li><a href="https://kotlinlang.org/docs/reference/basic-types.html#string-templates">String Templates — Kotlin Documentation</a>.</li><li><a href="https://medium.com/techmacademy/kotlin-101-val-vs-var-behind-the-scenes-65d96c6608bf">Kotlin 101: val vs var Behind the Scenes!</a></li></ul><h3>👋 Now…</h3><p><strong>I would like to personally invite you to </strong><a href="https://medium.com/techmacademy"><strong>follow Techmacademy</strong></a><strong> </strong>to find articles specially written for awesome learners like you.</p><p><strong>If you found this article helpful, your claps are very much appreciated to help others who are embarking on this journey.</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/600/1*kYMkxO_U5b5SQgsQBQr5lA.gif" /></figure><p>I would love to read your comments and thoughts.</p><p><a href="https://medium.com/@estefaniacn">Follow me on Medium</a> 😃 👍</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=4c874a3d63b1" width="1" height="1" alt=""><hr><p><a href="https://medium.com/techmacademy/string-templates-in-kotlin-behind-the-scenes-4c874a3d63b1">String Templates in Kotlin: Behind the Scenes!</a> was originally published in <a href="https://medium.com/techmacademy">Techmacademy</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
    </channel>
</rss>