<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
  <channel>
    <title>DEV Community: Sam</title>
    <description>The latest articles on DEV Community by Sam (@avetaangel43).</description>
    <link>https://dev.to/avetaangel43</link>
    <image>
      <url>https://media2.dev.to/dynamic/image/width=90,height=90,fit=cover,gravity=auto,format=auto/https:%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Fuser%2Fprofile_image%2F682557%2F3bc2cd2b-cf88-4e6f-a08b-9f608493b60a.gif</url>
      <title>DEV Community: Sam</title>
      <link>https://dev.to/avetaangel43</link>
    </image>
    <atom:link rel="self" type="application/rss+xml" href="https://dev.to/feed/avetaangel43"/>
    <language>en</language>
    <item>
      <title>How to use Array.Reduce() for JavaScript and the importance of DELETE EVERYTHING AND START FROM BEGINNING!</title>
      <dc:creator>Sam</dc:creator>
      <pubDate>Fri, 25 Feb 2022 05:25:24 +0000</pubDate>
      <link>https://dev.to/avetaangel43/how-to-use-arrayreduce-for-javascript-and-the-importance-of-delete-everything-and-start-from-beginning-49ee</link>
      <guid>https://dev.to/avetaangel43/how-to-use-arrayreduce-for-javascript-and-the-importance-of-delete-everything-and-start-from-beginning-49ee</guid>
      <description>&lt;p&gt;This short(sike) blurb is to highlight something I am very proud of myself of not only figuring it out, but realizing sometimes you just have to toss away what you had before! So I was watching this &lt;a href="https://youtu.be/HB1ZC7czKRs"&gt;video&lt;/a&gt; tackling array practices because I always shy away from them and always felt there were daunting. I never understood the usage of =&amp;gt; or mapping or reduce, so why not work on that! My biggest challenge was overall: Figuring out reduce.&lt;/p&gt;

&lt;p&gt;So from what I gather from the &lt;a href="https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/Reduce"&gt;MDN Article&lt;/a&gt; it is of the following:&lt;/p&gt;

&lt;blockquote&gt;
&lt;p&gt;The reduce() method executes a user-supplied "reducer" callback function on each element of the array, in order, passing in the return value from the calculation on the preceding element. The final result of running the reducer across all elements of the array is a single value.&lt;/p&gt;
&lt;/blockquote&gt;

&lt;p&gt;Honestly? I do not know what in the WORLD I just read. BUT! And bear with this noobie speaking, I am believing it takes in values, does arithmetic I say I want it to,&lt;/p&gt;

&lt;p&gt;And then returns one value which is the summation of values I passed through. Did I hit a hole in one yet? Swing!&lt;/p&gt;

&lt;p&gt;Okay! So my first draft of my code initially looked like this after reading documents(and stalking stack overflow :-) )&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="kd"&gt;function&lt;/span&gt; &lt;span class="nx"&gt;sum&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;inventors&lt;/span&gt;&lt;span class="p"&gt;){&lt;/span&gt;
 &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;reducer&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;sum&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;val&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;=&amp;gt;&lt;/span&gt; &lt;span class="nx"&gt;inventors&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;year&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="nx"&gt;inventors&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;passed&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
 &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;initialValue&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
 &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nx"&gt;inventors&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;reduce&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;reducer&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;initialValue&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;

&lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;result&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;sum&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;inventors&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
&lt;span class="nx"&gt;console&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;log&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;result&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;I kept getting a NaN and it was frustrating. Initially, I was expecting to have rows of each individual total years lived, but that was because I misunderstood and missed the key part of reduce saying that &lt;strong&gt;&lt;em&gt;The final result of running the reducer across all elements of the array is a single value.&lt;/em&gt;&lt;/strong&gt; Woops!&lt;/p&gt;

&lt;p&gt;So, I asked some good people I know for small pair programming to get a fresh perspective of what I was doing. And you know what was best for me to get over my confusion?&lt;/p&gt;

&lt;p&gt;I deleted everything and started from the top, this time with clarification from friends. Rewriting definitely helped me get a clearer picture and funny enough, I got the right answer thanks to friends pointing out when I was still thinking I was doing something wrong LOL!!!!!!!! This time, this is how my code looked:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="c1"&gt;//Array.prototype.reduce()&lt;/span&gt;
&lt;span class="c1"&gt;//My Notes&lt;/span&gt;
&lt;span class="c1"&gt;//Goal is to get the sum of years people live, inventors.passed - inventors.year&lt;/span&gt;
&lt;span class="c1"&gt;//We are using reduce method to accomplish this.&lt;/span&gt;

&lt;span class="c1"&gt;//array we have is inventors earlier up in code&lt;/span&gt;
&lt;span class="c1"&gt;//Now we have function to combine the values together&lt;/span&gt;
&lt;span class="c1"&gt;//let call the function "Sum" with parameters val(before I did inventors, which was incorrect)&lt;/span&gt;

&lt;span class="kd"&gt;function&lt;/span&gt; &lt;span class="nx"&gt;sum&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;val&lt;/span&gt;&lt;span class="p"&gt;){&lt;/span&gt;
 &lt;span class="c1"&gt;//initializing the initial value:&lt;/span&gt;
 &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;initialValue&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;

 &lt;span class="c1"&gt;//variable called reducer that does the arithmetic of pass-year&lt;/span&gt;
 &lt;span class="c1"&gt;//Want it to get each individual inventors' length of how long &lt;/span&gt;
 &lt;span class="c1"&gt;//They lived, and add them all up together&lt;/span&gt;
 &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;reducer&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;sum&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;val&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;=&amp;gt;&lt;/span&gt; &lt;span class="nx"&gt;val&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;passed&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="nx"&gt;val&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;year&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="nx"&gt;sum&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;

 &lt;span class="c1"&gt;//return the result&lt;/span&gt;
 &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nx"&gt;val&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;reduce&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;reducer&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;initialValue&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;

 &lt;span class="c1"&gt;//now to pass the inventor array through the sum function&lt;/span&gt;
 &lt;span class="nx"&gt;sumResult&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;sum&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;inventors&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
 &lt;span class="nx"&gt;console&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;log&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;sumResult&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;As a result, the console.log showed me the answer was 861. I was honestly proud of myself to do this without seeing solution first and its my &lt;strong&gt;first time doing a reduce&lt;/strong&gt; . It really makes a difference to properly document and comment out my journey, and sometimes start from the beginning :-) The life of a self-learning Developer!&lt;/p&gt;

&lt;p&gt;Here is the full code version for people to see for themselves:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="o"&gt;&amp;lt;!&lt;/span&gt;&lt;span class="nx"&gt;DOCTYPE&lt;/span&gt; &lt;span class="nx"&gt;html&lt;/span&gt;&lt;span class="o"&gt;&amp;gt;&lt;/span&gt;
&lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="nx"&gt;html&lt;/span&gt; &lt;span class="nx"&gt;lang&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;en&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="o"&gt;&amp;gt;&lt;/span&gt;

&lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="nx"&gt;head&lt;/span&gt;&lt;span class="o"&gt;&amp;gt;&lt;/span&gt;
  &lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="nx"&gt;meta&lt;/span&gt; &lt;span class="nx"&gt;charset&lt;/span&gt;&lt;span class="o"&gt;=&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;UTF-8&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="o"&gt;&amp;gt;&lt;/span&gt;
  &lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="nx"&gt;title&lt;/span&gt;&lt;span class="o"&gt;&amp;gt;&lt;/span&gt;&lt;span class="nb"&gt;Array&lt;/span&gt; &lt;span class="nx"&gt;Cardio&lt;/span&gt; &lt;span class="err"&gt;💪&lt;/span&gt;&lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="sr"&gt;/title&lt;/span&gt;&lt;span class="err"&gt;&amp;gt;
&lt;/span&gt;&lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="sr"&gt;/head&lt;/span&gt;&lt;span class="err"&gt;&amp;gt;
&lt;/span&gt;
&lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="nx"&gt;body&lt;/span&gt;&lt;span class="o"&gt;&amp;gt;&lt;/span&gt;
  &lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="nx"&gt;p&lt;/span&gt;&lt;span class="o"&gt;&amp;gt;&amp;lt;&lt;/span&gt;&lt;span class="nx"&gt;em&lt;/span&gt;&lt;span class="o"&gt;&amp;gt;&lt;/span&gt;&lt;span class="nx"&gt;Psst&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="nx"&gt;have&lt;/span&gt; &lt;span class="nx"&gt;a&lt;/span&gt; &lt;span class="nx"&gt;look&lt;/span&gt; &lt;span class="nx"&gt;at&lt;/span&gt; &lt;span class="nx"&gt;the&lt;/span&gt; &lt;span class="nx"&gt;JavaScript&lt;/span&gt; &lt;span class="nx"&gt;Console&lt;/span&gt;&lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="sr"&gt;/em&amp;gt; 💁&amp;lt;/&lt;/span&gt;&lt;span class="nx"&gt;p&lt;/span&gt;&lt;span class="o"&gt;&amp;gt;&lt;/span&gt;
  &lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="nx"&gt;script&lt;/span&gt;&lt;span class="o"&gt;&amp;gt;&lt;/span&gt;
    &lt;span class="c1"&gt;// Get your shorts on - this is an array workout!&lt;/span&gt;
    &lt;span class="c1"&gt;// ## Array Cardio Day 1&lt;/span&gt;

    &lt;span class="c1"&gt;// Some data we can work with&lt;/span&gt;

    &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;inventors&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[{&lt;/span&gt;
        &lt;span class="na"&gt;first&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Albert&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;last&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Einstein&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;year&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1879&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;passed&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1955&lt;/span&gt;
      &lt;span class="p"&gt;},&lt;/span&gt;
      &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="na"&gt;first&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Isaac&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;last&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Newton&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;year&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1643&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;passed&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1727&lt;/span&gt;
      &lt;span class="p"&gt;},&lt;/span&gt;
      &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="na"&gt;first&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Galileo&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;last&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Galilei&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;year&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1564&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;passed&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1642&lt;/span&gt;
      &lt;span class="p"&gt;},&lt;/span&gt;
      &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="na"&gt;first&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Marie&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;last&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Curie&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;year&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1867&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;passed&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1934&lt;/span&gt;
      &lt;span class="p"&gt;},&lt;/span&gt;
      &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="na"&gt;first&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Johannes&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;last&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Kepler&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;year&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1571&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;passed&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1630&lt;/span&gt;
      &lt;span class="p"&gt;},&lt;/span&gt;
      &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="na"&gt;first&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Nicolaus&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;last&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Copernicus&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;year&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1473&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;passed&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1543&lt;/span&gt;
      &lt;span class="p"&gt;},&lt;/span&gt;
      &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="na"&gt;first&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Max&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;last&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Planck&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;year&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1858&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;passed&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1947&lt;/span&gt;
      &lt;span class="p"&gt;},&lt;/span&gt;
      &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="na"&gt;first&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Katherine&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;last&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Blodgett&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;year&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1898&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;passed&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1979&lt;/span&gt;
      &lt;span class="p"&gt;},&lt;/span&gt;
      &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="na"&gt;first&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Ada&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;last&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Lovelace&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;year&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1815&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;passed&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1852&lt;/span&gt;
      &lt;span class="p"&gt;},&lt;/span&gt;
      &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="na"&gt;first&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Sarah E.&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;last&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Goode&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;year&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1855&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;passed&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1905&lt;/span&gt;
      &lt;span class="p"&gt;},&lt;/span&gt;
      &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="na"&gt;first&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Lise&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;last&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Meitner&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;year&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1878&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;passed&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1968&lt;/span&gt;
      &lt;span class="p"&gt;},&lt;/span&gt;
      &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="na"&gt;first&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Hanna&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;last&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Hammarström&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;year&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1829&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
        &lt;span class="na"&gt;passed&lt;/span&gt;&lt;span class="p"&gt;:&lt;/span&gt; &lt;span class="mi"&gt;1909&lt;/span&gt;
      &lt;span class="p"&gt;}&lt;/span&gt;
    &lt;span class="p"&gt;];&lt;/span&gt;

    &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;people&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;
      &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Bernhard, Sandra&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Bethea, Erin&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Becker, Carl&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Bentsen, Lloyd&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Beckett, Samuel&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Blake, William&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
      &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Berger, Ric&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Beddoes, Mick&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Beethoven, Ludwig&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
      &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Belloc, Hilaire&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Begin, Menachem&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Bellow, Saul&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Benchley, Robert&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Blair, Robert&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Benenson, Peter&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
      &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Benjamin, Walter&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Berlin, Irving&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
      &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Benn, Tony&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Benson, Leana&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Bent, Silas&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Berle, Milton&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Berry, Halle&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Biko, Steve&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Beck, Glenn&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
      &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Bergman, Ingmar&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Black, Elk&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Berio, Luciano&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
      &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Berne, Eric&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Berra, Yogi&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Berry, Wendell&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Bevan, Aneurin&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Ben-Gurion, David&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Bevel, Ken&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
      &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Biden, Joseph&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Bennington, Chester&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Bierce, Ambrose&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
      &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Billings, Josh&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Birrell, Augustine&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Blair, Tony&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Beecher, Henry&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Biondo, Frank&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;
    &lt;span class="p"&gt;];&lt;/span&gt;

    &lt;span class="c1"&gt;// Array.prototype.filter()&lt;/span&gt;
    &lt;span class="c1"&gt;// 1. Filter the list of inventors for those who were born in the 1500's&lt;/span&gt;
    &lt;span class="c1"&gt;// const fifteenHundred = inventors.filter(inventor =&amp;gt; (inventor.year &amp;gt;= 1500 &amp;amp;&amp;amp; inventor.year &amp;lt;= 1600))&lt;/span&gt;

    &lt;span class="c1"&gt;// console.table(fifteenHundred)&lt;/span&gt;

    &lt;span class="c1"&gt;//another way of writing&lt;/span&gt;

    &lt;span class="c1"&gt;// const fifteenHundrend2 = inventors.filter(function(inventor){&lt;/span&gt;
    &lt;span class="c1"&gt;//   if(inventor.year &amp;gt;= 1500 &amp;amp;&amp;amp; inventor.year &amp;lt;= 1600){&lt;/span&gt;
    &lt;span class="c1"&gt;//     return true;&lt;/span&gt;
    &lt;span class="c1"&gt;//   }&lt;/span&gt;

    &lt;span class="c1"&gt;// });&lt;/span&gt;



    &lt;span class="c1"&gt;// Array.prototype.map()&lt;/span&gt;
    &lt;span class="c1"&gt;// 2. Give us an array of the inventors first and last names&lt;/span&gt;
    &lt;span class="c1"&gt;// const fullNames = inventors.map(inventor =&amp;gt; inventor.first + " " + inventor.last);&lt;/span&gt;

    &lt;span class="c1"&gt;// console.log(fullNames);&lt;/span&gt;


    &lt;span class="c1"&gt;// Array.prototype.sort()&lt;/span&gt;
    &lt;span class="c1"&gt;// 3. Sort the inventors by birthdate, oldest to youngest&lt;/span&gt;

    &lt;span class="c1"&gt;// //my solution&lt;/span&gt;
    &lt;span class="c1"&gt;// function compareYears(a, b) {&lt;/span&gt;
    &lt;span class="c1"&gt;//    return a.year - b.year;&lt;/span&gt;
    &lt;span class="c1"&gt;//  }&lt;/span&gt;
    &lt;span class="c1"&gt;// //Sort the birth years by descending order&lt;/span&gt;
    &lt;span class="c1"&gt;// let sortedYears = inventors.sort(compareYears);&lt;/span&gt;
    &lt;span class="c1"&gt;// console.table(sortedYears);&lt;/span&gt;

    &lt;span class="c1"&gt;// //video's solution&lt;/span&gt;
    &lt;span class="c1"&gt;// // let orderedYears = inventors.sort(function (a, b) {&lt;/span&gt;
    &lt;span class="c1"&gt;// //   if (a.year &amp;gt; b.year) {&lt;/span&gt;
    &lt;span class="c1"&gt;// //     return 1;&lt;/span&gt;
    &lt;span class="c1"&gt;// //   } else {&lt;/span&gt;
    &lt;span class="c1"&gt;// //     return -1;&lt;/span&gt;
    &lt;span class="c1"&gt;// //   }&lt;/span&gt;
    &lt;span class="c1"&gt;// // })&lt;/span&gt;

    &lt;span class="c1"&gt;// let ordered = inventors.sort((a,b) =&amp;gt; a.year &amp;gt; b.year ? 1 : -1);&lt;/span&gt;

    &lt;span class="c1"&gt;// console.table(ordered);&lt;/span&gt;


    &lt;span class="c1"&gt;// Array.prototype.reduce()&lt;/span&gt;
    &lt;span class="c1"&gt;// 4. How many years did all the inventors live all together?&lt;/span&gt;

    &lt;span class="c1"&gt;//My Notes&lt;/span&gt;
    &lt;span class="c1"&gt;//Goal is to get the sums of years people live, inventors.passed - inventors.year&lt;/span&gt;
    &lt;span class="c1"&gt;//We are using reduce method to accomplish this.&lt;/span&gt;

    &lt;span class="c1"&gt;//array we have is inventors earlier up&lt;/span&gt;
    &lt;span class="c1"&gt;//Now we have function to  combine the values together&lt;/span&gt;
    &lt;span class="c1"&gt;//lets call the function "Sum" with parameters val&lt;/span&gt;

    &lt;span class="kd"&gt;function&lt;/span&gt; &lt;span class="nx"&gt;sum&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;val&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;

      &lt;span class="c1"&gt;//initializing the initial value:&lt;/span&gt;
      &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;initialValue&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;

      &lt;span class="c1"&gt;//variable called reducer that does the arithmetic of pass-year&lt;/span&gt;
      &lt;span class="c1"&gt;//Want it to get each individual inventors' length of how long they lived&lt;/span&gt;
      &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;reducer&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;sum&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;val&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;=&amp;gt;&lt;/span&gt; &lt;span class="nx"&gt;val&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;passed&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt; &lt;span class="nx"&gt;val&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;year&lt;/span&gt; &lt;span class="o"&gt;+&lt;/span&gt; &lt;span class="nx"&gt;sum&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;

      &lt;span class="c1"&gt;//return the result&lt;/span&gt;
      &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nx"&gt;val&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;reduce&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;reducer&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;initialValue&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
    &lt;span class="p"&gt;}&lt;/span&gt;

    &lt;span class="c1"&gt;//now to pass the inventor array through the sum function we did&lt;/span&gt;
    &lt;span class="nx"&gt;sumResult&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;sum&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;inventors&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
    &lt;span class="nx"&gt;console&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;log&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;sumResult&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;

    &lt;span class="c1"&gt;// 5. Sort the inventors by years lived&lt;/span&gt;

    &lt;span class="c1"&gt;// 6. create a list of Boulevards in Paris that contain 'de' anywhere in the name&lt;/span&gt;
    &lt;span class="c1"&gt;// https://en.wikipedia.org/wiki/Category:Boulevards_in_Paris&lt;/span&gt;


    &lt;span class="c1"&gt;// 7. sort Exercise&lt;/span&gt;
    &lt;span class="c1"&gt;// Sort the people alphabetically by last name&lt;/span&gt;

    &lt;span class="c1"&gt;// 8. Reduce Exercise&lt;/span&gt;
    &lt;span class="c1"&gt;// Sum up the instances of each of these&lt;/span&gt;
    &lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;data&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;car&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;car&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;truck&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;truck&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;bike&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;walk&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;car&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;van&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;bike&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;walk&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;car&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;van&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;car&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt;
      &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;truck&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;
    &lt;span class="p"&gt;];&lt;/span&gt;
  &lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="sr"&gt;/script&lt;/span&gt;&lt;span class="err"&gt;&amp;gt;
&lt;/span&gt;&lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="sr"&gt;/body&lt;/span&gt;&lt;span class="err"&gt;&amp;gt;
&lt;/span&gt;
&lt;span class="o"&gt;&amp;lt;&lt;/span&gt;&lt;span class="sr"&gt;/html&lt;/span&gt;&lt;span class="err"&gt;&amp;gt;
&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;It's pretty neat documenting the bumps and roads along the way. Its astonishing how much one can grow in due time!&lt;/p&gt;

&lt;p&gt;Here's a silly way I try to make Array.reduce make sense to me:&lt;/p&gt;

&lt;p&gt;We are taking kitchen items for ONE box labeled "kitchen"&lt;/p&gt;

&lt;p&gt;We moving out! So! The kitchen items can represent the array of values(say [1,2,3]) w.e. &lt;strong&gt;The box with label is the summation of all the kitchen items (in the array).&lt;/strong&gt; Us putting the items in box is the "reducer function" where all these several, spread out messy kitchen items are neatly put in a box that when we are done, we got just ONE box aka the sum of the values.&lt;/p&gt;

&lt;p&gt;Sorry if it sounds silly, but I try to make it make sense for me!&lt;/p&gt;

&lt;p&gt;Mind you the putting into box can be anything! Take two kitchen items to put in box(adding), break a kitchen item before putting in box(subtract) for simple examples. Cant explain how multiply or  divide will work in rea life but LMAO hope the gist is understood. I'll figure it out!&lt;/p&gt;

&lt;p&gt;Update:&lt;br&gt;
I was told the following by a friend: Not just math/arithmetic though. You can use it to take an array of objects and turn it into a single object for example. Or you could use it to turn an array of strings into a single string."&lt;/p&gt;

&lt;p&gt;So that's like baking a delicious Apple pie! Several ingredients coming together to make one yummy tasty treat!! Hope the delicious analogy helps! Are you making a pie? A stew? A brownie? Depends on what you want to make (the function passed to reduce).&lt;/p&gt;

&lt;p&gt;That function is the recipe. Reduce just follows the recipe with the ingredients you give it. So if you pass it a recipe for brownies but give it ingredients for a stew, you get garbage. But if you pass it brownie ingredients and a brownie recipe you get brownies!&lt;/p&gt;

</description>
    </item>
    <item>
      <title>5 AM Thoughts - Changing the Script Of Tech Interview Process</title>
      <dc:creator>Sam</dc:creator>
      <pubDate>Mon, 03 Jan 2022 11:07:09 +0000</pubDate>
      <link>https://dev.to/avetaangel43/5-am-thoughts-changing-the-script-of-tech-interview-process-i33</link>
      <guid>https://dev.to/avetaangel43/5-am-thoughts-changing-the-script-of-tech-interview-process-i33</guid>
      <description>&lt;p&gt;&lt;strong&gt;&lt;em&gt;Full disclaimer: As I am writing this, it is 5:32 AM in the morning for me(Eastern time) and I am restless, so I chose to write my thoughts that (hopefully?) can spark a productive conversation. I'd love to hear peoples' thoughts.&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;I know I am still new to the industry and I have a lot to learn and experience. The one thing I just cannot seem to grasp though is the constant talk and reiteration of how the process has grown out of control, hurting potential hires who end up quitting the industry before getting a foot in the door because the interview process has become so.... unhealthy. &lt;/p&gt;

&lt;p&gt;Yet, I hear this a lot and very few offer solutions or just say to continue feeding into the broken process that is starting to fester like a sore that has not been given proper attention and treatment. Or perhaps, I should say, the process is working as it's intended to be which is snuffing out potential talent that do not pass the criteria that the broken process singles out to seek after like a moth seeking a light source.&lt;/p&gt;

&lt;p&gt;Aren't Technical Interviews meant to gauge a candidate's ability to organize and gather pieces of logic in one's mind in the sense of bringing a solution to a concrete problem, thus resulting in showcasing how one would design or architect a solution? How is LeetCode and HackerRank supposed to help solve this when it's the same questions and answers that can go down to mere memorization? Is it not, in that manner, just &lt;a href="https://en.wikipedia.org/wiki/Competitive_programming"&gt;competitive programming&lt;/a&gt; where one can invert a binary tree in 30 seconds because they have done it millions of times? I admit, I think LeetCode and HackerRank can be great practice for one self-learning or in college and has yet to graduate. &lt;/p&gt;

&lt;p&gt;However, although it is a good source of practice, the fact of the matter that LeetCode and HackerRank questions are used as a indication of one being granted an opportunity of a job that bring about a significant difference to one's life, in addition as used as an indicator of being a "good enough Software Engineer" seems to do more harm than good.&lt;/p&gt;

&lt;p&gt;There are people memorize a Data structure and algorithm problem, but can they actually code from scratch or debug an existing script that has nothing to do with DSA? Do they know how to do Test Driven Development? Do they know how to pair program? I've heard time and time again, depending on role you go for, DS&amp;amp;A will barely be used in the actual code-base itself. How are interpersonal qualities measured? Or does that not matter as long as they know how to spit out code?&lt;/p&gt;

&lt;p&gt;I've heard from people that DS&amp;amp;A is just a filter to weed out people that can't pass medium-hard problems on leetcode, hacker-rank. So what gives? I genuinely wonder. &lt;/p&gt;

&lt;p&gt;Perhaps I say this because I've been told how I am not capable of being in Tech because I cannot do such problems. I may not know how to memorize such problems, but sit me down with some team members to collaborate and figure out what to do and build and I'd be on cloud nine enjoying myself talking to people and learning. I'd be happy to know that the work and time I put can be something bigger than me and my team. The lives that can be made better, the efficiency of daily tasks that can be done with whatever product I work on. &lt;/p&gt;

&lt;p&gt;I just do not feel it is healthy on both ends to have over 7 rounds of interviews. Time is a very sensitive manner and this varies upon each individual, especially those with a family to take care of. I admit, I am biased on this part since I patiently stuck through interviews ranging from 2 to 4 months, completing all the rounds and even making it to the final round only to be told my lack of experience is what worries the company or they suddenly decided they had no need for the role to be opened because someone got the role internally. Such is life, you know?&lt;/p&gt;

&lt;p&gt;I genuinely wonder, has there ever been a full, fleshed out conversation among people on what ways to do an interview process that isn't trying to imitate FAANG? Or perhaps, a cap of how many can apply to a place that doesn't end up being overwhelmed or resorting to said flawed procedures? These are thoughts that constantly run through my mind that I do not know and am so young to the experience.&lt;/p&gt;

&lt;p&gt;I saw someone by the name of Jim S. write the following of interview process they have done: &lt;/p&gt;

&lt;blockquote&gt;
&lt;p&gt;"Assuming a candidate looks potentially “good enough” on paper, I pair-program FizzBuzz with them for an hour sometimes two. This simple exercise: leads to many, many conversations around principle and practices; shows me how well what they’ve written about themselves matches up with reality; let’s me know what it would be like working with them; in short, tells me everything I need to know and eliminates guess-work.&lt;/p&gt;

&lt;p&gt;So, they’ve never paired before? Cool! Let’s see how well they learn and whether they’re amenable to change. They’ve never done TDD before? Great! See above re learning and change.&lt;/p&gt;

&lt;p&gt;We have fun. Almost every time I’m told stuff along the lines of, “that was fun,” and, “I learned a lot.”&lt;/p&gt;

&lt;p&gt;I’ve been happy with every hire that we’ve made based on this simple interview style."&lt;/p&gt;
&lt;/blockquote&gt;

&lt;p&gt;This comment was then followed up by someone who asked what does one do for 1-2 hours using just FizzBuzz. Is it just simply rewriting it in different ways? I was curious too and this is what Jim continued saying:&lt;/p&gt;

&lt;blockquote&gt;
&lt;p&gt;"Not exactly - sort of. It depends on the candidate.&lt;/p&gt;

&lt;p&gt;If they’re good at TDD and pairing we start ripping thru FizzBuzz and launch into conversations about TDD, Four Rules of Simple Design, SOLID, “if as a guard clause, never else,” Law of Demeter, pair programming, mob programming, microservices, event driven designs, our favorite authors and what they wrote that changed our perceptions, etc. It could easily go beyond two hours on all those topics, as I’m sure you know.&lt;/p&gt;

&lt;p&gt;If they’re not versed in TDD and pair programming I see how quickly and well they learn, and whether they enjoy learning new things.&lt;/p&gt;

&lt;p&gt;After implementing the second business rule simply within the single method we’ll often start talking about SRP and how we might solve the SRP violation that is beginning to emerge. Sometimes that comes later.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;The refactoring that we do along the way in FizzBuzz, and the conversations that we have as a result, are what tells me a lot about how the candidate think about software."&lt;/strong&gt;&lt;/p&gt;
&lt;/blockquote&gt;

&lt;p&gt;The conversation came from this &lt;a href="https://www.linkedin.com/posts/kevm254_softwareengineering-react-angular-activity-6882003818926661632-H8qL/"&gt;LinkedIn Post&lt;/a&gt; that honestly sparked me to write this blurb/early morning thoughts. It actually had me thinking "Man, I'd love to interview on FizzBuzz right now!" and then it had me thinking,&lt;/p&gt;

&lt;p&gt;Imagine if companies adopted such a creative way to interview that had people wanting to sign up for such, knowing it'll be a healthy and productive one that can leave the candidate learning something or knowing something from said interview, even if not selected.&lt;/p&gt;

&lt;p&gt;I guess it's wishful thinking and again, this is just my early morning rambling.&lt;/p&gt;

&lt;p&gt;But I truly wish that in this year of 2022 where we promise changed habits or new things, this year can be a year where early career software engineers like myself can see change in the industry and us given a chance to be a member of said change. &lt;/p&gt;

&lt;p&gt;But then again, I know my voice probably means so little right now and I've come to terms with that after all that has happened. I can only dream of a better tomorrow. &lt;/p&gt;

</description>
      <category>programming</category>
      <category>discuss</category>
      <category>womenintech</category>
    </item>
    <item>
      <title>JavaScript Dev Learning Journey - Leap Year!</title>
      <dc:creator>Sam</dc:creator>
      <pubDate>Mon, 03 Jan 2022 00:55:39 +0000</pubDate>
      <link>https://dev.to/avetaangel43/javascript-dev-learning-journey-leap-year-287o</link>
      <guid>https://dev.to/avetaangel43/javascript-dev-learning-journey-leap-year-287o</guid>
      <description>&lt;p&gt;I am currently picking back up on assignments I have been working on to improve my JavaScript self-learning journey and currently doing a program to determine if a year given is a Leap Year or not! What better way to start a new year :-)&lt;/p&gt;

&lt;p&gt;My first step right away was looking up the method of how to determine if a year is a leap year, which I found out through a &lt;a href="https://docs.microsoft.com/en-us/office/troubleshoot/excel/determine-a-leap-year"&gt;Microsoft docs &lt;/a&gt; which states the following:&lt;/p&gt;

&lt;blockquote&gt;
&lt;p&gt;&lt;strong&gt;Any year that is evenly divisible by 4 is a leap year: for example, 1988, 1992, and 1996 are leap years.&lt;/strong&gt;&lt;/p&gt;
&lt;/blockquote&gt;

&lt;p&gt;Which seems pretty easy ! Right away I knew I would be coding a conditional statement so I wrote up the following:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;leapYears&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="kd"&gt;function&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;yearNum&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;

    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;yearNum&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="mi"&gt;4&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="kc"&gt;true&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="p"&gt;}&lt;/span&gt;&lt;span class="k"&gt;else&lt;/span&gt;&lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="kc"&gt;false&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="p"&gt;}&lt;/span&gt;

&lt;span class="p"&gt;};&lt;/span&gt;

&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Of course, as I was going through the tests, thinking I am in the clear, I knew a part of me felt that this was too easy/good to be true. Sure enough, I ran into a problem where my test failed when the year was 1900 for example. So what I decided to do was go back to documentation to see if there's anything about that and sure enough:&lt;/p&gt;

&lt;blockquote&gt;
&lt;p&gt;&lt;em&gt;&lt;strong&gt;However, there is still a small error that must be accounted for. To eliminate this error, the Gregorian calendar stipulates that a year that is evenly divisible by 100 (for example, 1900) is a leap year only if it is also evenly divisible by 400.&lt;/strong&gt;&lt;/em&gt;&lt;/p&gt;
&lt;/blockquote&gt;

&lt;p&gt;So that means although 1900 works with 100, it doesn't work with 400 and therefore is not a leap year!&lt;/p&gt;

&lt;p&gt;So, now I need to account for how to make a number go through several checks:&lt;/p&gt;

&lt;ol&gt;
&lt;li&gt;Make sure it is divisible by 4. &lt;/li&gt;
&lt;li&gt;Check to see if it's divisible by 100 AND 400 after checking if divisible by 4. &lt;/li&gt;
&lt;li&gt;If it's divisible by 100 but NOT 400, it's not a leap year. Same if it's flipped around. &lt;/li&gt;
&lt;/ol&gt;

&lt;p&gt;That's a simple fix! Taking my previous code, I've updated it to the following:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;leapYears&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="kd"&gt;function&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;yearNum&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;

    &lt;span class="k"&gt;if&lt;/span&gt; &lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;yearNum&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="mi"&gt;4&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="o"&gt;&amp;amp;&amp;amp;&lt;/span&gt; &lt;span class="nx"&gt;yearNum&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="mi"&gt;100&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="o"&gt;&amp;amp;&amp;amp;&lt;/span&gt; &lt;span class="nx"&gt;yearNum&lt;/span&gt; &lt;span class="o"&gt;%&lt;/span&gt; &lt;span class="mi"&gt;400&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="kc"&gt;true&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="p"&gt;}&lt;/span&gt;&lt;span class="k"&gt;else&lt;/span&gt;&lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="kc"&gt;false&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="p"&gt;}&lt;/span&gt;

    &lt;span class="c1"&gt;//Any year divisible by 4 is a leap year.&lt;/span&gt;
    &lt;span class="c1"&gt;//Check if divisible by 3 numbers: 4, 100, and 400. &lt;/span&gt;
    &lt;span class="c1"&gt;//if-statements on passing all three conditions to be leap years&lt;/span&gt;


&lt;span class="p"&gt;};&lt;/span&gt;

&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Where yearNum is checked to have a remainder 0(hence the usage of % to show if it's divisible by a number) with 4, 100, AND 400. This will cover the cases where it can be divisible by 4 and 100 BUT not by 400, making it NOT a leap year. This goes the same if divisible by 100 and 400, but not 4 in addition to divisible by 400 and 4, but not 100.&lt;/p&gt;

&lt;p&gt;And no-- 2022 is not a leap year. 2024 is when we will have our next leap year!&lt;/p&gt;

</description>
      <category>javascript</category>
      <category>beginners</category>
      <category>tutorial</category>
      <category>programming</category>
    </item>
    <item>
      <title>2022: Year of Growth and Ownership</title>
      <dc:creator>Sam</dc:creator>
      <pubDate>Sun, 02 Jan 2022 01:52:33 +0000</pubDate>
      <link>https://dev.to/avetaangel43/2022-year-of-growth-and-ownership-oe</link>
      <guid>https://dev.to/avetaangel43/2022-year-of-growth-and-ownership-oe</guid>
      <description>&lt;p&gt;&lt;a href="https://res.cloudinary.com/practicaldev/image/fetch/s--Fp7zRYnA--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/ka7ui0hjex10glknysx6.png" class="article-body-image-wrapper"&gt;&lt;img src="https://res.cloudinary.com/practicaldev/image/fetch/s--Fp7zRYnA--/c_limit%2Cf_auto%2Cfl_progressive%2Cq_auto%2Cw_880/https://dev-to-uploads.s3.amazonaws.com/uploads/articles/ka7ui0hjex10glknysx6.png" alt="Picture of landing page of personal dev website. Picture of Black woman smiling wearing a yellow shirt." width="880" height="572"&gt;&lt;/a&gt;&lt;/p&gt;

&lt;p&gt;Happy New Year! I hope the new year is treating everyone well. For me, I have been battling sickness for a while now, which made Holidays a lot harder since nothing was done. I was honestly depressed because end of the year is always hard for me all of my life and getting through it. It's a journey battling depression and a lot of other things, but I know I am not alone. I wanted to share with you all &lt;a href="https://samanthabadeau.dev/index.html"&gt;my personal website&lt;/a&gt; that I am honestly so proud about having released. It's my pride and joy right now. It has a lot of work to it that will get better as I learn more and grow in my journey. Thanks to someone kind enough to donate me time to my domain in addition to pushing me to get it done,&lt;/p&gt;

&lt;p&gt;I was like, heck I got to go for it. And I am stunned. Stunned at how it looks, what I accomplished, what I am capable of. &lt;/p&gt;

&lt;p&gt;My future employer does not know what's coming for them!!!! I am excited to learn anything needed to get the job done, to collaborate, to grow. My goal is to be able to get out of the state I am in, to see new sights and live a life on my own two feet. I know I will get there. I just need to be given that "yes". That chance of someone believing in a early-career like me.&lt;/p&gt;

&lt;p&gt;No longer I am calling myself a Junior. I am a Software Engineer through and through.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;&lt;em&gt;I will break barriers. I will make a change in the tech industry that will shake tables.&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;I am ready.&lt;/p&gt;

&lt;p&gt;This is my testimony.&lt;/p&gt;

</description>
      <category>programming</category>
      <category>webdev</category>
      <category>motivation</category>
      <category>blacktech</category>
    </item>
    <item>
      <title>Psuedo-code is so important!</title>
      <dc:creator>Sam</dc:creator>
      <pubDate>Tue, 21 Dec 2021 08:11:50 +0000</pubDate>
      <link>https://dev.to/avetaangel43/psuedo-code-is-so-important-kip</link>
      <guid>https://dev.to/avetaangel43/psuedo-code-is-so-important-kip</guid>
      <description>&lt;p&gt;I am proud of what I accomplished in learning Test Driven Development as I self-teach myself JavaScript. Better late than never. Continuing in exercises that I initially mentioned in an &lt;a href="https://dev.to/aliofonzy43/self-learning-javascript-journey-1pl3"&gt;earlier article&lt;/a&gt;, this time the exercise is sumAll where you have a beginning number and ending number and wanting to add all the numbers in between, including the end and starting points.&lt;/p&gt;

&lt;p&gt;What I did first was do psuedo-code because I keep being told how it makes things a lot more clear and I am glad I did because I knew what I wanted in human language, and need to translate to computer.&lt;/p&gt;

&lt;p&gt;I admit, sometimes I feel the urge of just doing the programming and make it perfect as I can because that was what I was taught in classes. But, I am starting to see how people are right that it's better to plan and break down the problems one by one. And I usually run into code-blocks and get myself frustrated and give up. But this problem I didn't feel any frustration when I wrote down what I want, variables I want to name, like naming ingredients for a recipe! I found myself referring back to my human notes each time I felt like I wasn't getting somewhere and utilizing Stack Overflow and google to learn of functions like instanceof that can do checking of parameters being an array or not.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight plaintext"&gt;&lt;code&gt;  //What code should accomplish
  //Want two variables, numStart and numEnd
  //Loop to begin at numStart and end at numEnd
  //Add numbers between numStart and numEnd, including the two in summation
  //return the sum at the end, variable named finalSum
  //check if parameters are negative or non-number as well
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Then it was a matter of getting right output, and I had quite a few console.log to check :) I almost got stuck at part where larger number is started first, but then realized it's the same logic, except we would be decrementing instead of incrementing.&lt;/p&gt;

&lt;p&gt;The complete code is as follows:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;sumAll&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nf"&gt;function &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;numStart&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;numEnd&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;

    &lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;finalSum&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="c1"&gt;//holds the sum of numbers&lt;/span&gt;
    &lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;addedNumbers&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="c1"&gt;//hold added numbers&lt;/span&gt;
    &lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;i&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;numStart&lt;/span&gt;

    &lt;span class="c1"&gt;//Checking right away to see if number is non-number or negative.&lt;/span&gt;
    &lt;span class="k"&gt;if &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;i&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt; &lt;span class="o"&gt;||&lt;/span&gt; &lt;span class="k"&gt;typeof&lt;/span&gt; &lt;span class="nx"&gt;numStart&lt;/span&gt; &lt;span class="o"&gt;!=&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;number&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt; &lt;span class="o"&gt;||&lt;/span&gt; &lt;span class="k"&gt;typeof&lt;/span&gt; &lt;span class="nx"&gt;numEnd&lt;/span&gt; &lt;span class="o"&gt;!=&lt;/span&gt; &lt;span class="dl"&gt;"&lt;/span&gt;&lt;span class="s2"&gt;number&lt;/span&gt;&lt;span class="dl"&gt;"&lt;/span&gt; &lt;span class="o"&gt;||&lt;/span&gt;
        &lt;span class="nx"&gt;numStart&lt;/span&gt; &lt;span class="k"&gt;instanceof&lt;/span&gt; &lt;span class="nb"&gt;Array&lt;/span&gt; &lt;span class="o"&gt;||&lt;/span&gt; &lt;span class="nx"&gt;numEnd&lt;/span&gt; &lt;span class="k"&gt;instanceof&lt;/span&gt; &lt;span class="nb"&gt;Array&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;ERROR&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
    &lt;span class="p"&gt;}&lt;/span&gt;

    &lt;span class="c1"&gt;//handles case when numStart is larger&lt;/span&gt;
    &lt;span class="k"&gt;while &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;i&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;&lt;/span&gt; &lt;span class="nx"&gt;numEnd&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="nx"&gt;addedNumbers&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="nx"&gt;i&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
        &lt;span class="nx"&gt;i&lt;/span&gt;&lt;span class="o"&gt;--&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;

        &lt;span class="k"&gt;if &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;i&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="nx"&gt;numEnd&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
            &lt;span class="nx"&gt;addedNumbers&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="nx"&gt;i&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
            &lt;span class="nx"&gt;finalSum&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;addedNumbers&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
            &lt;span class="nx"&gt;console&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;log&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;#2 Final sum is: &lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;finalSum&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
        &lt;span class="p"&gt;}&lt;/span&gt;
    &lt;span class="p"&gt;}&lt;/span&gt;

    &lt;span class="c1"&gt;//handles case when numStart is smaller&lt;/span&gt;
    &lt;span class="k"&gt;while &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;i&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;&lt;/span&gt; &lt;span class="nx"&gt;numEnd&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
        &lt;span class="nx"&gt;addedNumbers&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="nx"&gt;i&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
        &lt;span class="nx"&gt;i&lt;/span&gt;&lt;span class="o"&gt;++&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;

        &lt;span class="k"&gt;if &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;i&lt;/span&gt; &lt;span class="o"&gt;==&lt;/span&gt; &lt;span class="nx"&gt;numEnd&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
            &lt;span class="nx"&gt;addedNumbers&lt;/span&gt; &lt;span class="o"&gt;+=&lt;/span&gt; &lt;span class="nx"&gt;i&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
            &lt;span class="nx"&gt;finalSum&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;addedNumbers&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
            &lt;span class="nx"&gt;console&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;log&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="s1"&gt;Final sum is: &lt;/span&gt;&lt;span class="dl"&gt;'&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;finalSum&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
        &lt;span class="p"&gt;}&lt;/span&gt;
    &lt;span class="p"&gt;}&lt;/span&gt;
    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nx"&gt;finalSum&lt;/span&gt;

&lt;span class="p"&gt;};&lt;/span&gt;


&lt;span class="c1"&gt;// Do not edit below this line&lt;/span&gt;
&lt;span class="nx"&gt;module&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;exports&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;sumAll&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;I say all of this to document my journey and look back when I improve and become a senior in this field I chose to pursue. Although I feel disheartened and sad over how I cannot truly enjoy the holidays as I should because I cannot afford to do so, one day I will have my Tech career providing me the accessibility to needs and financial stability that will allow me to have fun and feel accomplished.&lt;/p&gt;

&lt;p&gt;Each day is a step to that brighter tomorrow, even though I may walk in darkness. This is my testimony of a rising Computer Engineer.&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fsqjt0gliqewelujpsyaa.gif" class="article-body-image-wrapper"&gt;&lt;img src="https://media.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2Fsqjt0gliqewelujpsyaa.gif" alt="Image of sailor moon with her fist balled up in a stance of determination"&gt;&lt;/a&gt;&lt;/p&gt;

</description>
      <category>javascript</category>
      <category>beginners</category>
      <category>programming</category>
      <category>productivity</category>
    </item>
    <item>
      <title>Self-Learning JavaScript Journey</title>
      <dc:creator>Sam</dc:creator>
      <pubDate>Thu, 16 Dec 2021 20:54:47 +0000</pubDate>
      <link>https://dev.to/avetaangel43/self-learning-javascript-journey-1pl3</link>
      <guid>https://dev.to/avetaangel43/self-learning-javascript-journey-1pl3</guid>
      <description>&lt;p&gt;In small short bursts of productivity and the ADHD urge to have exciting blurbs of newfound excitement of learning(who can relate!!? :-) ), I will do my best to share small tid-bits of my journey into learning JavaScript and working on myself to become the best web developer I can be!&lt;/p&gt;

&lt;p&gt;I am using &lt;a href="https://www.theodinproject.com/" rel="noopener noreferrer"&gt;The Odin Project&lt;/a&gt; to help me in my journey and I have been loving what I have been doing so far.&lt;/p&gt;

&lt;p&gt;Right now, I am working on learning the concept of "Test-Driven Development" which at first glance for me, I interpreted as software development that is largely developed. It was new to me that in the work place, tests are made of what code should be doing &lt;em&gt;&lt;strong&gt;before&lt;/strong&gt;&lt;/em&gt; the actual code is even written up! This is news to me since in college, they never really emphasized or told us about how the work life can differ so much on what classes may exhibit, in addition to we were never really given the opportunity to make our own test, but use test what was provided and build code around it for it to passed. So this is a steep learning curve for me that I am grateful to push myself towards.&lt;/p&gt;

&lt;p&gt;The current incomplete coding challenge I am doing revolving around TDD is removing values from an array using JavaScript.&lt;/p&gt;

&lt;p&gt;The following code I have works in removing a single value from an array:&lt;/p&gt;

&lt;p&gt;In my current understanding, I have an array object that is not an array instance, and a rest parameter to  be a placeholder for an arbitrary number of arguments I want to pass through.&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nf"&gt;removeFromArray&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;array&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="p"&gt;...&lt;/span&gt;&lt;span class="nx"&gt;multArgs&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;

    &lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[].&lt;/span&gt;&lt;span class="nx"&gt;slice&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;call&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;array&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
    &lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;indexArg&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;indexOf&lt;/span&gt;&lt;span class="p"&gt;(...&lt;/span&gt;&lt;span class="nx"&gt;multArgs&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;

    &lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;splice&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;indexArg&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;

    &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;

    &lt;span class="p"&gt;};&lt;/span&gt;


  &lt;span class="nx"&gt;module&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;exports&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;removeFromArray&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Since it successfully passed the first test, I moved on to the second test case I needed to do which was having multiple values removed instead of a single one.&lt;/p&gt;

&lt;p&gt;My next approach was trying for a for-loop. &lt;br&gt;
The notes I took were the following:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;Whenever I deal with arrays, I always immediately go for for-loop knowing I have to iterate through the elements. It seems as the best approach to handle array elements, pending discovery of new functions/elements that can accomplish what I want.&lt;/li&gt;
&lt;li&gt;Rest parameters I understand is a placeholder for an arbitrary number of arguments wanting to be passed through, hence the utilization.&lt;/li&gt;
&lt;/ul&gt;

&lt;p&gt;My code is then slightly changed to the following where it currently fails both the single value and multiple value:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nf"&gt;removeFromArray&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;array&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="p"&gt;...&lt;/span&gt;&lt;span class="nx"&gt;multArgs&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;

    &lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="p"&gt;[].&lt;/span&gt;&lt;span class="nx"&gt;slice&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;call&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;array&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
    &lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;indexArg&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;indexOf&lt;/span&gt;&lt;span class="p"&gt;(...&lt;/span&gt;&lt;span class="nx"&gt;multArgs&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;

        &lt;span class="k"&gt;for&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;i&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;length&lt;/span&gt;&lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="nx"&gt;i&lt;/span&gt; &lt;span class="o"&gt;&amp;gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="nx"&gt;i&lt;/span&gt;&lt;span class="o"&gt;--&lt;/span&gt;&lt;span class="p"&gt;){&lt;/span&gt;
             &lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;splice&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;indexArg&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;
        &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
 &lt;span class="p"&gt;};&lt;/span&gt;


  &lt;span class="nx"&gt;module&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;exports&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;removeFromArray&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;After asking someone to do feedback on this manner to improve, I have received helpful tips that I am still navigating through.&lt;/p&gt;

&lt;p&gt;First thing I learned: Array.from. &lt;/p&gt;

&lt;p&gt;According to &lt;a href="https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/from" rel="noopener noreferrer"&gt;documentation&lt;/a&gt;, it creates a new, shallow-copied Array instance from an array-like object.&lt;/p&gt;

&lt;p&gt;In my own understanding: Its just another way to make my array parameter an array instance or a copy to say the least. &lt;/p&gt;

&lt;p&gt;I am very weird in repeating  concepts and things I see, but this is how it makes sense to my brain.&lt;/p&gt;

&lt;p&gt;My coding journey continues on how I improve and reach a solution!&lt;/p&gt;

&lt;p&gt;I hope to update you all soon on when I finally approach a working solution!&lt;/p&gt;

&lt;p&gt;&lt;em&gt;I have had some try to just send me a solution, but I know I cannot learn that way! I need to approach it on my own hand to feel accomplished so I appreciate anyone helping, but I appreciate if I am not handed stuff easily! :-)&lt;/em&gt;&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;Update as of 8:43 PM EST&lt;/strong&gt;&lt;/p&gt;

&lt;p&gt;I have reached to a solution thanks to having a productive pair program and a little nudge from people to get on the right track. This is important to me as a junior developer to have soundboard and active, live feedback. I tried rubber ducking, but it didn't help me much because the rubber ducky couldn't talk back to me. :-) But, I digress.&lt;/p&gt;

&lt;p&gt;So! The following code has passed the multiple value test cases I had. &lt;/p&gt;

&lt;p&gt;What I had did was take my function that was able to remove &lt;strong&gt;one value&lt;/strong&gt; and make it its own function to where it can handle taking &lt;strong&gt;one value at a time&lt;/strong&gt; in terms of handling multiple values. &lt;/p&gt;

&lt;p&gt;I also learned about how tricky off by one errors can be. The code below I initially had my for statement in the typical&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="k"&gt;for&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;i&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="mi"&gt;0&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="nx"&gt;i&lt;/span&gt; &lt;span class="o"&gt;&amp;lt;&lt;/span&gt; &lt;span class="nx"&gt;multArgs&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;length&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt; &lt;span class="nx"&gt;i&lt;/span&gt;&lt;span class="o"&gt;++&lt;/span&gt;&lt;span class="p"&gt;){}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;fashion and it ended up taking out an additional value that wasn't being indicated to remove! So to handle that off by one, I changed my for statement to&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt; &lt;span class="k"&gt;for &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;argument&lt;/span&gt; &lt;span class="k"&gt;of&lt;/span&gt; &lt;span class="nx"&gt;multArgs&lt;/span&gt;&lt;span class="p"&gt;){}&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;to handle that logical error.&lt;/p&gt;

&lt;p&gt;I am so glad it started working!&lt;/p&gt;

&lt;p&gt;However, &lt;strong&gt;not all of the test cases are working&lt;/strong&gt; the ones it did not work with are the following:&lt;/p&gt;

&lt;ul&gt;
&lt;li&gt;what it doesn't work with yet:&lt;/li&gt;
&lt;li&gt;ignores non present values&lt;/li&gt;
&lt;li&gt;ignores non present values but still works
and&lt;/li&gt;
&lt;li&gt;only removes same type
&lt;/li&gt;
&lt;/ul&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;
&lt;span class="c1"&gt;//function that handles removing multiple values&lt;/span&gt;
&lt;span class="c1"&gt;//one at a time&lt;/span&gt;
&lt;span class="kd"&gt;function&lt;/span&gt; &lt;span class="nf"&gt;removeOneValue&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;array&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;valueToRemove&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
  &lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;Array&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="k"&gt;from&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;array&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;

  &lt;span class="k"&gt;if &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;changeArray&lt;/span&gt; &lt;span class="o"&gt;!=&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;indexArg&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;indexOf&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;valueToRemove&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
    &lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;splice&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;indexArg&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
  &lt;span class="p"&gt;}&lt;/span&gt;

  &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;

&lt;span class="p"&gt;}&lt;/span&gt;

&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;removeFromArray&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nf"&gt;function &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;array&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="p"&gt;...&lt;/span&gt;&lt;span class="nx"&gt;multArgs&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;

  &lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;Array&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="k"&gt;from&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;array&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;

  &lt;span class="c1"&gt;//looping through all the arguments that is seen&lt;/span&gt;
  &lt;span class="c1"&gt;//this handles off by one error&lt;/span&gt;
  &lt;span class="k"&gt;for &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;argument&lt;/span&gt; &lt;span class="k"&gt;of&lt;/span&gt; &lt;span class="nx"&gt;multArgs&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;

    &lt;span class="nx"&gt;changeArray&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nf"&gt;removeOneValue&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;argument&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;

  &lt;span class="p"&gt;}&lt;/span&gt;

  &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;



&lt;span class="c1"&gt;// module.exports = removeFromArray;&lt;/span&gt;

&lt;span class="c1"&gt;// Do not edit below this line&lt;/span&gt;
&lt;span class="nx"&gt;module&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;exports&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;removeFromArray&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;

&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;So what is the issue? It lies within the code snippet that says:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="k"&gt;if &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;changeArray&lt;/span&gt; &lt;span class="o"&gt;!=&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;where there isn't a proper checking of non-present values. This is changed by updating it to:&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;indexOf&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;valueToRemove&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;!=&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;where if the index of the valueToRemove is present in changeArray, carry out the splicing, otherwise, ignore it and move on.&lt;/p&gt;

&lt;p&gt;The updated code is shown below&lt;br&gt;
&lt;/p&gt;

&lt;div class="highlight js-code-highlight"&gt;
&lt;pre class="highlight javascript"&gt;&lt;code&gt;&lt;span class="c1"&gt;//function that handles removing values one at a time&lt;/span&gt;
&lt;span class="kd"&gt;function&lt;/span&gt; &lt;span class="nf"&gt;removeOneValue&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;array&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;valueToRemove&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
  &lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;Array&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="k"&gt;from&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;array&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
  &lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;indexArg&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;indexOf&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;valueToRemove&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;

&lt;span class="c1"&gt;//we want to check to make such index&lt;/span&gt;
&lt;span class="c1"&gt;//of value to remove is &lt;/span&gt;
&lt;span class="c1"&gt;//present in change array or not&lt;/span&gt;
  &lt;span class="k"&gt;if &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;indexOf&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;valueToRemove&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="o"&gt;!=&lt;/span&gt; &lt;span class="o"&gt;-&lt;/span&gt;&lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nf"&gt;splice&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;indexArg&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="mi"&gt;1&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
  &lt;span class="p"&gt;}&lt;/span&gt;

  &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;

&lt;span class="p"&gt;}&lt;/span&gt;

&lt;span class="kd"&gt;const&lt;/span&gt; &lt;span class="nx"&gt;removeFromArray&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nf"&gt;function &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;array&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="p"&gt;...&lt;/span&gt;&lt;span class="nx"&gt;multArgs&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;

  &lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nb"&gt;Array&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="k"&gt;from&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;array&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
  &lt;span class="c1"&gt;//looping through all the arguments that is seen&lt;/span&gt;
  &lt;span class="c1"&gt;//this handles off by one error&lt;/span&gt;
  &lt;span class="k"&gt;for &lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="kd"&gt;let&lt;/span&gt; &lt;span class="nx"&gt;argument&lt;/span&gt; &lt;span class="k"&gt;of&lt;/span&gt; &lt;span class="nx"&gt;multArgs&lt;/span&gt;&lt;span class="p"&gt;)&lt;/span&gt; &lt;span class="p"&gt;{&lt;/span&gt;
    &lt;span class="nx"&gt;changeArray&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nf"&gt;removeOneValue&lt;/span&gt;&lt;span class="p"&gt;(&lt;/span&gt;&lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;,&lt;/span&gt; &lt;span class="nx"&gt;argument&lt;/span&gt;&lt;span class="p"&gt;);&lt;/span&gt;
  &lt;span class="p"&gt;}&lt;/span&gt;

  &lt;span class="k"&gt;return&lt;/span&gt; &lt;span class="nx"&gt;changeArray&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;span class="p"&gt;}&lt;/span&gt;



&lt;span class="c1"&gt;// Do not edit below this line&lt;/span&gt;
&lt;span class="nx"&gt;module&lt;/span&gt;&lt;span class="p"&gt;.&lt;/span&gt;&lt;span class="nx"&gt;exports&lt;/span&gt; &lt;span class="o"&gt;=&lt;/span&gt; &lt;span class="nx"&gt;removeFromArray&lt;/span&gt;&lt;span class="p"&gt;;&lt;/span&gt;
&lt;/code&gt;&lt;/pre&gt;

&lt;/div&gt;



&lt;p&gt;Overall, I am pretty proud of myself of sticking to seeing this through and accomplishing my hurdle and I am grateful for individuals in Tech community being a listening ear for me and pushing me to find the solution on my own and me not just giving up and finding a solution elsewhere. &lt;/p&gt;

&lt;p&gt;Cheers!&lt;/p&gt;

&lt;p&gt;&lt;a href="https://media.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7048z4rvzur6ofv5gbbx.gif" class="article-body-image-wrapper"&gt;&lt;img src="https://media.dev.to/dynamic/image/width=800%2Cheight=%2Cfit=scale-down%2Cgravity=auto%2Cformat=auto/https%3A%2F%2Fdev-to-uploads.s3.amazonaws.com%2Fuploads%2Farticles%2F7048z4rvzur6ofv5gbbx.gif" alt="Gif of sailor moon holding paper dancing with Luna in background on sailor moon's bed staring at her"&gt;&lt;/a&gt;&lt;/p&gt;

</description>
      <category>beginners</category>
      <category>javascript</category>
      <category>webdev</category>
      <category>productivity</category>
    </item>
    <item>
      <title>Exhaustion From Tech Hiring Process</title>
      <dc:creator>Sam</dc:creator>
      <pubDate>Wed, 24 Nov 2021 22:24:14 +0000</pubDate>
      <link>https://dev.to/avetaangel43/exhaustion-from-tech-hiring-process-2geb</link>
      <guid>https://dev.to/avetaangel43/exhaustion-from-tech-hiring-process-2geb</guid>
      <description>&lt;h1&gt;
  
  
  The Update Thus Far
&lt;/h1&gt;

&lt;p&gt;Hey everyone! I know it's been quite a minute since &lt;a href="https://samsterpiece.hashnode.dev/my-first-software-engineer-internship-during-covid-19-how-and-what-i-learned-from-it"&gt;my last blog post&lt;/a&gt; , but I will do my best to update and write here accordingly. I have immersed myself into a journey of self-learning, networking and of course, applying to jobs and doing interviews. I decided after being encouraged by a few individuals to write my thoughts in this blog, to shed a light of how I feel and to make it known, hoping it may be the sign or signal for something to change.&lt;/p&gt;

&lt;p&gt;So buckle in, grab some tea and biscuits because this is opening myself in a very transparent manner that I am not used to.&lt;/p&gt;

&lt;h1&gt;
  
  
  My (Exhausting) Story
&lt;/h1&gt;

&lt;p&gt;In this section, I want to just go over a bit of how some interview processes were like for me. There has been a lot I have done which surprises my own self, and it would take a whole book to list them so I will only highlight a few. After doing virtual career events, networking with career coaches who were kind enough to give me consultation free of charge because of my circumstances and them seeing I am genuine about making friends and not just using people for their knowledge, I cleaned up my resume pretty well, sending pictures upon pictures of updated text and format to a few trusted individuals who have been my soundboards and biggest supporters through this process.&lt;/p&gt;

&lt;p&gt;As a result, the notifications of how frequently end up on the searches in LinkedIn or having people message me saying "Hey, I wanted to reach out after hearing you on ...", so on and so forth. It's pretty neat I will admit to get this and I am grateful for this outcome.&lt;/p&gt;

&lt;p&gt;Now let's get into parts of interviews. Many I had started with a phone call, doing the intro, the role, and me explaining what I am looking for in the company and in the role. The usual. There have been a few times companies did not want to waste any time and send a work prompt/technical assessment to get the ball rolling which was also neat and even moreso neat that the work I was given, wasn't some Hacker Rank timed assessment, but work reflective of what I would do should I be onboarded. These are the interviews I seek that are more humane for me, more of a less frustrating process to do, in addition to helps me gauge when given a challenge, how far I will go.&lt;/p&gt;

&lt;p&gt;At most, the rounds of these interviews were 5 to 6. One place was 10 interview rounds, and no, it was not a FAANG company. The process for most of these interviews were 2-4 weeks.&lt;/p&gt;

&lt;p&gt;About 5 companies I did interview with in close timelines- Lasted a month(1), a month and a half(2), two months(3), 3 months(4), and 4 months(5) as I currently write this.&lt;/p&gt;

&lt;p&gt;The roles I picked were all ones that were stated explicitly to be early-career friendly, open to recent grads, the usual spiel. Some I took the leap of faith knowing I wasn't qualified and still applied just to see how far I can go. I am proud to say that many of these I knocked off one by one, celebrating my wins with people I message on social media of my progress, feeling good to be given notification of next round.&lt;/p&gt;

&lt;p&gt;Never mind the fact some had stalled for a week or two until giving that notification, I knew that as a Black woman in STEM, I can't be picky about the process because I do not have that power nor place to bounce back on. I know that because of how I was born, I do not have much impact in what happens to me and I have to fight for myself. I have to fight to get where I want to be because not many will fight for me if it means risking their own position. I have to stay positive and grateful for every possible opportunity coming into my way, even though each rejection, each delay, each doubt I can read on peoples' face as I express my passion in tech, it kills a part of me inside every time. I know no matter how unfair it is people may say, I cannot change it with the lack of impact and power I have. I cannot change what I am being denied entry to. So I wait. I smile and I wait.&lt;/p&gt;

&lt;p&gt;I keep waiting. I patiently waited despite my anxiety gets through the roof. I waited despite I cried myself to sleep at night wondering where did I go wrong in the process and did I say one word wrong, did my clothes look professional enough, did I not smile enough.&lt;/p&gt;

&lt;p&gt;At one point, I knew I got a rejection when an email came and I don't see a file attached. Sometimes, just seeing the first few words going "Thank you very much for taking the time to apply to..." is enough for me to not bother reading the rest. Though, curiosity gets the best of me and I still open email just to know the inevitable,&lt;/p&gt;

&lt;p&gt;&lt;em&gt;Application pool was really competitive.&lt;/em&gt;&lt;/p&gt;

&lt;p&gt;&lt;em&gt;You were not selected.&lt;/em&gt;&lt;/p&gt;

&lt;p&gt;&lt;em&gt;We wish you the best in your endeavors.&lt;/em&gt;&lt;/p&gt;

&lt;p&gt;Back to square one. Back to the start after well over a two-week process. Back to the self-pep talks, praying, playing motivational music, getting my neurodivergent brain to not go in panic mode day of a meeting and get myself in the zone. Back to it all over again. But it's not enough. It's not enough as I read articles, read Tweets from seasoned tech people on what one should do to get a job. I'm not doing enough staying up, having sleepless nights as I read, meditate, practice, code, curate spaces and talk to people and network and do everything I am told is the best way.&lt;/p&gt;

&lt;p&gt;The rejection letters still come. I switch up my approach, switch up my style, get feedback. Rejected.&lt;/p&gt;

&lt;p&gt;I do projects, take some freelance and allow myself to get some exposure under my belt even though I am not being paid learning what I am, even as the fridge goes low on food and having to plan how a sandwich or a small meal can be broken into 4 days.&lt;/p&gt;

&lt;p&gt;I continue. I fight. I process and I endure as so much in life is happening around me and working to break away and get in an environment that is new. But it's not enough.&lt;/p&gt;

&lt;p&gt;It's not professional enough. It's not good enough for entry into tech. It's not being passionate enough. It's not optimistic or a cultural fit enough.&lt;/p&gt;

&lt;p&gt;It's as if I am in an infinite for-loop in the tech process that has no breakpoints, no stopping statement to stop the debilitating, soul-crushing feeling,&lt;/p&gt;

&lt;p&gt;Of knowing one can't even qualify for the lowest-level position there is to offer because they do not have experience for a position that should be where one starts to build to gain said experience.&lt;/p&gt;

&lt;p&gt;What also can be hurtful and this is the human part of me: Is seeing others who got opportunities because of their family or not having to do most of what I have done to get a job, making a change in their life. This is exclusively in regards to people I talked to about what I have been doing to get a job and them being absolutely floored by it because they never even thought of doing what I had to because when they had their own process,&lt;/p&gt;

&lt;p&gt;They were believed and given a chance. They didn't even have to wait for two weeks. They were given such a timely-mannered opportunity that allowed them to grow beyond expectations.&lt;/p&gt;

&lt;p&gt;All because someone believed in them. They didn't do well in technical interviews, but was given that chance to show up in work and do better. They were given grace.&lt;/p&gt;

&lt;p&gt;I choke up inside wondering did I do something wrong to not be deserving of grace too. Did I not be polite enough or professional enough or erase my identity enough to where I am but a blank slate that is easily written, just to be given the grace of opportunity?&lt;/p&gt;

&lt;p&gt;I truly wondered this at times and I will always push for positivity because I love positivity.&lt;/p&gt;

&lt;p&gt;Though I will admit I cannot deny my feelings and the tears that shed on my face of feeling as though I am not enough despite working to the point of exhaustion because that's the professional ideology of needing to show drive and passion just to be worthy of advancement.&lt;/p&gt;

&lt;p&gt;I have been told that all it takes is one yes out of the thousands of no's to get the door.&lt;/p&gt;

&lt;p&gt;That one yes comes from a lot of pain, sweat, and tears and breaking one's self down in many ways unimaginable to the human language,&lt;/p&gt;

&lt;p&gt;All for an entry-level job.&lt;/p&gt;

&lt;p&gt;So I ponder, I sit and wonder when would there be change. When would what is said to be broken by design, would be adamantly challenged and pushed. I wonder who or what would it take to have the push for a system that does right by the people instead of succumbing to the system that continues to dim one's bright soul each time a meeting is set up and posted.&lt;/p&gt;

&lt;p&gt;Or is it just balm glossed over wounds for one to have false belief they just have to do what they can and succumb to the monster of the process, thinking by the sweet honey-laced words of others who got in before it got this bad, that it will be taken care of, never to be addressed and soon bloom into a festering boil?&lt;/p&gt;

&lt;p&gt;I truly wonder about it all.&lt;/p&gt;

&lt;p&gt;I am exhausted, and I am still continuing fighting the good fight to be where I want to be,&lt;/p&gt;

&lt;p&gt;In NYC, as a Software Engineer.&lt;/p&gt;

&lt;p&gt;Though some days, my light dims in despair.&lt;/p&gt;

&lt;p&gt;&lt;strong&gt;&lt;em&gt;I am tired.&lt;/em&gt;&lt;/strong&gt;&lt;/p&gt;

</description>
      <category>mentalhealth</category>
      <category>career</category>
      <category>codenewbie</category>
    </item>
  </channel>
</rss>
