<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0" xmlns:cc="http://cyber.law.harvard.edu/rss/creativeCommonsRssModule.html">
    <channel>
        <title><![CDATA[Stories by Jeffrey Ogah on Medium]]></title>
        <description><![CDATA[Stories by Jeffrey Ogah on Medium]]></description>
        <link>https://medium.com/@jeffogah?source=rss-93f172144ac7------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/2*wX8RFwU4Y71hXVXJnhzDiA.jpeg</url>
            <title>Stories by Jeffrey Ogah on Medium</title>
            <link>https://medium.com/@jeffogah?source=rss-93f172144ac7------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Wed, 18 Nov 2026 18:49:38 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@jeffogah/feed" rel="self" type="application/rss+xml"/>
        <webMaster><![CDATA[yourfriends@medium.com]]></webMaster>
        <atom:link href="http://medium.superfeedr.com/" rel="hub"/>
        <item>
            <title><![CDATA[2019- And so it begins]]></title>
            <link>https://medium.com/@jeffogah/2019-and-so-it-begins-fc94a8bda5ac?source=rss-93f172144ac7------2</link>
            <guid isPermaLink="false">https://medium.com/p/fc94a8bda5ac</guid>
            <dc:creator><![CDATA[Jeffrey Ogah]]></dc:creator>
            <pubDate>Tue, 31 Dec 2019 23:39:46 GMT</pubDate>
            <atom:updated>2019-12-31T23:53:44.902Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*CSCBrhD7ZACdP2k6mJEMig.jpeg" /><figcaption>SSA Community Leads Summit, Accra</figcaption></figure><p>Earlier this year I tweeted that I would write about my journey in 2019. I haven’t done it before, but as the year went on, I realized I was having my best so far so it seemed only right. Despite this, I pondered not writing at some point (for various reasons), but here I am, on the 31st, penning this down because I know someday I’ll need to come back to this to draw inspiration.</p><h3>What’s in a title?</h3><p>I name this article so because I like to think of 2019 as my first year in tech. I did spend the better part of 2 years prior writing basic code but I was a lone wolf- disconnected from community and lacking an area to focus on. It wasn’t until late 2018 that I got immense inspiration when I attended DevFest SS Uyo. This helped me start 2019 with a bang and set up my journey so I would like to give a big shout-out to the GDG Uyo team.</p><p>In a nutshell, in 2019 I was able to: carve a niche for myself, get a job (for a while), speak/host events, write a technical article, expand my network and get more involved in communities.</p><p>These were part of my goals starting out and they were important for me because I needed to define an area for myself, increase my visibility and hone my skills. Looking back, I saw that I achieved most of this and it’s something I’m grateful for, despite the inevitable L’s that came.</p><h3>C stands for Community</h3><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*swV8iYuxY7ZU9aVKwGeQBw.jpeg" /><figcaption>HNGi6 Lagos Meetup</figcaption></figure><p>This sums up majority of my year. I spent most of the year involved in communities, either hosting events, volunteering, giving a talk or mentoring. I love doing this because I know how much time I spent trying to find my foot. When I started joining communities and attending events, I gained massive exposure and inspiration. At the end of the day, being able to connect with like-minded individuals who constantly motivate and push you to go beyond your limits is extremely important. In addition, volunteering and sharing the bits you know is a great way to give back.</p><h4>The Highlights</h4><figure><img alt="" src="https://cdn-images-1.medium.com/max/567/1*Cpp3blFGexfuVWrutqgXSA.png" /><figcaption>Developer Circles: Web Development Recipients</figcaption></figure><p>Quite a lot happened for me this year, here are some truly memorable moments for me:</p><ul><li>Committed to #100DaysOfCode with FreeCodeCamp- I took the first half focused on Front-end Development and I was able to gain the basics that I would go on to use for the rest of the year.</li><li>Built a website for Facebook Developer Circles Uyo- This was my first time working on a fully fledged project. I worked with React and Bootstrap on the Frontend alongside <a href="https://medium.com/u/e60e1b111dd3">Elisha Ukpong</a> using Laravel on the Backend. It was immensely challenging but very satisfying when it was completed.</li><li>Finalist at HNG Internship 5.0- This might have been the most challenging thing I did this year. The fact I got to lead a team for the latter part of the internships and eventually finish as a finalist did amazing things for my confidence in addition to solidifying the skills I learned.</li><li>Mentor at StartNG and HNG Internship 6.0- giving lessons and helping to guide interns during the pre-internship (StartNG) and the main internship was one of the things I absolutely loved doing.</li><li>Accepted as Developer Student Club Lead- I was reluctant to apply at first, but eventually Elisha convinced me. The application process was rigorous and tiring to say the least, but it doesn’t hold a candle to the feeling of the acceptance mail. I got to establish a community at my school and hold workshops to teach and guide aspiring developers.</li><li>Google Developer’s Sub-Saharan Africa Community Summit (Accra)- This was another really big part and one that rightly merits an article on it’s own. Suffice to say, I got to meet so many amazing personalities. We spent the better part of the week going over various ways to improve our respective communities. Massive shoutout to <a href="https://medium.com/u/aaa1fed5b491">Auwal MS</a>, <a href="https://medium.com/u/fb80690688e0">Ada Nduka Oyom</a>, <a href="https://medium.com/u/aefb5f359b56">Aniedi Udo-Obong</a> for making this happen.</li><li>Developer Circles: Web Development Recipients 2019- Got a scholarship from Facebook’s Developer Circles Program. This was really big because only 53 people were selected <strong>globally</strong>! I am really grateful I got this opportunity as well as an amazing mentor who I love working with.</li><li>DevC Training with Andela: Uyo Facilitator- I was both a learner and facilitator. Successfully hosted 2 meetup. This was the first time I had to fully organize an event, including budget and accounting for various situations. It was scary but eventually I pulled it off with help from <a href="https://medium.com/u/7f156d83daa1">Edmund Ekott</a> and Raphael Noriode who were mentors in the program.</li><li>Volunteered at Andela Career Fair, DevFest Uyo - In case it wasn’t obvious, I love engaging with communities. I volunteered for these events and I got to see the somewhat stressful parts of preparing for an event. As stressful as these were, it’s gratifying to see it successful hold. This also made me appreciate the efforts of event organizers too.</li><li>Speaker at NodeJs Akwa Ibom- This was my first (and only) speaking engagement of the year asides communities I either lead or am a core team member. Speaking at an event was one of my goals for 2019 and I was glad to be able to do this.</li><li>Accepted as a Microsoft Student Partner and Ingressive Campus Ambassador- Both had similarly tedious application processes, but I’m glad I got to be accepted. I’ve been able to meet a lot of amazing people due to these.</li><li>Open Source Community Africa: Uyo- Got to be a part of the team and we successfully hosted the first meetup this year. That also happened to be the my last event of the year and it was a great way to close out.</li><li>Wrote a technical article- Although I had planned to write a lot more, I was only able to write one article (on algorithms). You can read it <a href="https://medium.com/swlh/a-beginners-guide-to-algorithms-fb7109d6db79?source=---------2------------------">here</a>. I will definitely do more of this in 2020.</li></ul><h3>The non-techy part</h3><p>This year was also my last in school. Ironically, despite being my busiest year (I recall having to travel in-between exams), it was also my best year academically. For me, this just reinforced the idea that it’s really all in the mind. My self-confidence peaked, and frankly it felt like there was nothing I couldn’t achieve if I put my mind to it and the required effort.</p><p>In my first and second years, I erred in some courses and my CGPA took a hit. I was determined to finish with a first class, but that required me making straight A’s (with a couple B’s at most) if I was going to meet up. Suffice to say, my third and fourth (final) year had near perfect grades and I hit my target. In addition, the external examiner loved my project so he selected me and two others to present our work at an upcoming conference (sponsored). It definitely was difficulty keeping up with school at some points, but I was able to keep at it and it paid off!</p><h3>The not-so-rosy part</h3><h3>Jeff on Twitter</h3><p>@laurieontech Rejection happens, get used to it</p><p>When Laurie asked this, my answer came in a second. Asides the little Ls here and there, there were two major ones I faced this year. The first came with call for speakers during DevFest season. Considering DevFest kick-started my journey, I decided I would bring it full circle by speaking at one and potentially inspiring someone else. This wasn’t to be my year though, as I applied for 3 but got none. The second came with a technical test for a Job offer. I ended up flunking the test and I didn’t get a response (yet at least).</p><p>Despite how both of these felt, I had to look for the takeaways so I can improve. I spent time going back to the drawing board and I realized numerous areas I could have done better. Overall, it was painful but I was able to learn from it.</p><h3>Up Next?</h3><p>For a first year, I feel immensely inspired whenever I recall various events. I’m also someone that loves setting silent bigger goals, and I have those drawn up for 2020 already. You’ll hear from me when I hit them.</p><p>To everyone that was a part of my year in some way, I really appreciate having you in my life. There are way too many to start listing so I’ll simply say thanks. Let’s do more amazing things in 2020.</p><p>Cheers!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=fc94a8bda5ac" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[A Beginner’s Guide to Algorithms]]></title>
            <link>https://medium.com/swlh/a-beginners-guide-to-algorithms-fb7109d6db79?source=rss-93f172144ac7------2</link>
            <guid isPermaLink="false">https://medium.com/p/fb7109d6db79</guid>
            <category><![CDATA[beginner]]></category>
            <category><![CDATA[javascript]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[coding]]></category>
            <dc:creator><![CDATA[Jeffrey Ogah]]></dc:creator>
            <pubDate>Thu, 01 Aug 2019 18:54:09 GMT</pubDate>
            <atom:updated>2019-08-03T09:51:06.611Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*_Jm5XJOngV_bBovsMgjK1g.jpeg" /></figure><p>An algorithm is basically a set of steps taken to solve a problem. This process isn’t always easy, even for experienced developers. Newer developers also sometimes get stuck, not knowing how to approach a problem or where to get started. Here I’ll talk about some things you could do to simplify this process and hopefully boost your problem solving skills! We’ll also go through a challenge while implementing the steps here.</p><h3>Read. Then read again</h3><p>It may seem simplistic, but this is an important first step. It’s difficult to solve a problem you don’t understand, and to understand the problem, you’ll need to read it a couple times. There’s no set amount on how many times you should do this, or how fast/slow you should. Whatever works for you is fine. Try to break the problem into bits as you re-read, creating a mental picture as you go along.</p><p>Here is a sample problem we’ll solve together. We’ll use JavaScript to solve this, but you can use pretty much any language to reproduce it. The major difference will be in syntax and perhaps implementation.</p><pre>Rearrange Array Elements so as to form two numbers such that their sum is maximum possible. The number of digits in both the numbers cannot differ by more than 1. Attempt to solve this without using a built-in sorting function.</pre><pre>for e.g. [1, 2, 3, 4, 5]</pre><pre>The expected answer would be [531, 42]. Another expected answer can be [542, 31]. In scenarios such as these when there are more than one possible answers, return any one.</pre><p>In the above problem, we’re tasked with creating two numbers such that when added together, we’d have the maximum sum possible. If you don’t immediately understand the challenge, that’s fine. Take some time to re-read again, evaluating the requirements, sample output and what is expected.</p><h3>Break ’em down</h3><p>Next will be to break it into bits and pieces. You can ask some simple questions here to better understand the problem. Sample questions are:</p><ul><li><em>Am I working with any input? If yes, what data type is involved?</em></li><li><em>What sort of computation am I doing? Is it mathematical? Logical? Both? etc.</em></li><li><em>What am I required to do?</em></li><li><em>What sort of output is expected?</em></li></ul><p>These are some general questions, but depending on the problem, you might have different set of questions. It’s also fine if your breakdown is vague, the idea is to get started. In the above challenges, after breaking it down, we could have this:</p><ul><li><em>Accept an array of numbers as input</em></li><li><em>Create two numbers containing a combination of the numbers from the array</em></li><li><em>Confirm the number of digits in both arrays are either the same (if the array had an even number of elements) or differ by one (if the array had an odd number of elements)</em></li><li><em>Ensure the sum of both numbers is the largest possible number</em></li><li><em>Return an array containing these two numbers</em></li></ul><p>With this, we have a pretty good picture of what exactly we need to do.</p><h3>Solve the problem manually</h3><p>You’ve probably heard that computers are dumb. It’s garbage in, garbage out. Arguments may be made that with machine learning and artificial intelligence the above isn’t entirely accurate but that’s beside the point. Essentially, the computer isn’t going to solve the problem for you, that’s the reason we write codes, to give instructions detailing what we want the computer to do. If you want to write a piece of code to solve a problem, you need to be able to solve the problem yourself, or at least understand the steps enough.</p><p>This part is usually where logic and problem solving ability comes in. It’s also arguably the hardest part, but the good news is that with practice, you can improve your problem solving ability. Earlier we broke our problem statement into bits. There is one major part that requires logic, the other parts are mostly flavor that are more based on syntax. Accepting input or providing an output can be done relatively easily. Creating numbers and ensuring the number of digits are the same the same or differ by one can also be worked out a bit easily. However, the fourth point is a bit vague and requires more thought</p><blockquote>Ensure the sum of both numbers is the largest possible number</blockquote><p>It’s vague and open-ended. We don’t know the numbers we are working with beforehand, or how many numbers are involved. Testing sums of all possible combinations (brute-force) is potentially one way although we would be left with a rather inefficient solution. It’s not too difficult to imagine why, with more input, our program will exponentially increase in complexity and end up using too many resources.</p><p>We’ve decided brute-force isn’t exactly an ideal approach so let’s look at something else. Since we’re looking for the highest sum, it makes sense that the biggest numbers will combine to form the highest numbers. After all, 5+6 will give a higher number than 4+5. Let’s test our approach with the sample input. Essentially, we’ll lump the biggest numbers together and see what we get.</p><pre>input- [1, 2, 3, 4, 5]<br>numbers- [543,21]<br>sum- 564</pre><p>But wait, something isn’t quite right. Based on the expected output, we should have had something like this</p><pre>input- [1, 2, 3, 4, 5]<br>numbers- [531, 42]<br>sum- 573</pre><p>Our presumed solution is a bit off. One good thing about testing manually this way is that you can immediately see what works and what doesn’t without having to immediately worry about implementation. If you observe our previous approach a bit more, you may notice why it didn’t work. Take some minutes to analyse it first.</p><p>Were you able to figure it out? Well, we were on track with adding biggest numbers because we know that certainly bigger numbers added together give bigger sum totals. However, we didn’t actually do this in the first approach. We grouped all the biggest numbers together in the first generated number, thus leaving smaller numbers in the corresponding number positions of the second generated number. Writing it out will make this a bit clearer</p><pre><strong>First approach</strong><br>first    543  (<em>the biggest numbers are already grouped here</em>)<br>second +  21  (<em>smaller numbers here</em>)<br>total  = 564</pre><pre><strong>Expected approach</strong><br>first    531  (<em>Every other big number is grouped here</em>)<br>second +  42  (<em>same thing here</em>)<br>total  = 573</pre><p>Our first approach is actually mapping smaller numbers in the same positions, so we’re not adding the biggest numbers at all. Like this it’s a bit easier to understand what we should do. If we alternate between passing the highest numbers between the first and second generate number, then the biggest numbers get paired. Let’s assume we call our variables <em>firstNum</em> and <em>secondNum</em>, then our process will be something like this:</p><ul><li><em>Add highest number to firstNum</em></li><li><em>Add second highest number to secondNum</em></li><li><em>Add third highest number to firstNum</em></li><li>repeat ….</li></ul><p>By add here, I mean concatenate (or join) and by doing this, we will pair the biggest numbers together each time and thus produce the biggest sum.</p><h3>Use Pseudo-code</h3><p>Now it’s time to write a mock or something a bit closer to code than the algorithm we derived earlier. Our pseudo-code can look like this</p><pre>function largestSum(arr){<br>/* create a temporary array to prevent mutation of original array</pre><pre>create two empty strings- firstNum and secondNum to hold the created numbers</pre><pre>initialize loop</pre><pre>find the largest number in the array</pre><pre>alternatively concatenate largest number between firstNum and secondNum</pre><pre>remove largest number from array so the next largest number can be found</pre><pre>repeat steps until no numbers remain in the array</pre><pre>return array consisting of firstNum and secondNum */</pre><pre>}</pre><p>Our function accepts an array of numbers (arr). First I create a temporary array with the same values. This is to avoid mutation. A good rule is to work without mutating (or changing) the values of the original array or object that was passed as an input. Next I create two variables (<em>firstNum</em> and <em>secondNum</em>) to hold the numbers we create. Afterwards, we start a loop with the following steps:</p><ul><li><em>Find the largest number in the temporary array</em></li><li><em>Add (concatenate) this number with firstNum or secondNum alternatively</em></li><li><em>Remove the largest number from the temporary array</em></li><li><em>Return to step 1 and repeat until there are no numbers left</em></li></ul><p>Writing your pseudo-code with comments like this is also helpful because the comments are explanatory so you know what you’re trying to do at each point. You could even leave the comments for readability and understanding (we’ll talk a bit about this later)</p><h3>Write code, then test</h3><p>At this point, you’ve done a lot of the heavy lifting already. About half of the work is done now, what’s left is basically syntax. It’s fine if you don’t have the necessary code in your head, and that’s not the important part. You’ll naturally get better with time and muscle memory as you work. You can check official documentation of the language you’re using, use Google or <a href="https://stackoverflow.com/">StackOverflow</a> to assist you.</p><p>Here’s a sample code to solve the problem based on our pseudo-code</p><pre>function largestSum(arr){<br>  let tempArr = [...arr]<br>  let firstNum = &quot;&quot;, secondNum = &quot;&quot;,  maxNum, maxIndex;<br>  <br>  for (let num in arr) {<br>    maxNum = Math.max(...tempArr); //find max number<br>    maxIndex = tempArr.indexOf(maxNum)<br>    if (num % 2 === 0) {  //alternate concatenation <br>       firstNum += maxNum;<br>     }<br>     else {<br>       secondNum += maxNum;<br>     }<br>       tempArr.splice(maxIndex,1) //delete used max Number<br>   }<br>    <br>  return [firstNum, secondNum] </pre><pre>}</pre><p>This is a JavaScript implementation as mentioned earlier. If you go through the pseudo-code and the code, you will be able to understand how it works. I’ve included some comments as well. It’s encouraged to include comments in your code. Someone else may not immediately understand what you’re doing or why you did it. In addition, if you return to the same code you wrote some months back, you’d essentially have become a stranger and might struggle to recall why you did something. Comments generally simplify the steps so always try to include them.</p><p>Lastly, you should test your code, check for possible bugs and try to break it. It’s much better if you find a loophole and fix it compared to someone else doing that. Find what works, what doesn’t work and why, then try to resolve the troublesome cases. For example, your solution may work for an array of even number size but not odd. Observe to figure out what’s causing the break and work to fix it.</p><h3>Optimize and simplify</h3><p>Usually, the first step is to get the code working regardless of how inefficient it may be. Once you have a working solution, you should then look for ways to optimize it. You could ask some questions like these:</p><ul><li><em>Are you using too many variables?</em></li><li><em>Are the variables names descriptive enough?</em></li><li><em>Was that loop or conditional really necessary?</em></li><li><em>How about defining another function if you are repeating steps?</em></li><li><em>What about using higher-order or built-in functionality?</em></li></ul><p>There are usually many ways to optimize code by reducing the complexity. It’s a bonus if you can improve readability as well. This is also something you improve with time as you grow.</p><h3>Study other solutions and get feedback</h3><p>So now you finally managed to solve the problem, but there are usually numerous ways to tackle the same problem. Try to find other solutions to the same problem. Carefully observe their methodology and try to understand the approach used. A lot of times, you learn better ways to approach problems as well as potential ways to optimize your own solution. I make it a rule to always check at least 3 other solutions to every problem I solve (where possible) to learn more. I can’t count how many times I’ve ended being surprised by an ingenious approach. You’ll get to see a lot of “out-of-the-box” approaches solving the same problem in brilliant ways.</p><p>If possible, also try to get feedback on your code. You could host your solution somewhere eg <a href="https://github.com/">GitHub</a> or just show others. If you’re in a developer community, a WhatsApp group, or maybe even a Slack workspace, you can share you solution and ask for feedback. Some communities are centered around solving problems like these. You’ll gain immense value by doing these.</p><h3>Practice</h3><p>Finally, if you really want to improve, you’d have to practice over and over again. Try to solve problems as often as possible, employing the above steps (especially review and studying other solutions). This is guaranteed to improve your problem solving skills.</p><p>There are some amazing platforms that have thousands of challenge problems of varying levels. Look for something close to your level of competency and solve it, but don’t spend too long solving easy challenges otherwise you won’t get to flex and improve your skills. <a href="https://www.codewars.com/">Codewars</a> and <a href="https://www.hackerrank.com/">HackerRank</a> are good sites to test your skills.</p><p>Hope these will be able to help you in some way.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=fb7109d6db79" width="1" height="1" alt=""><hr><p><a href="https://medium.com/swlh/a-beginners-guide-to-algorithms-fb7109d6db79">A Beginner’s Guide to Algorithms</a> was originally published in <a href="https://medium.com/swlh">The Startup</a> on Medium, where people are continuing the conversation by highlighting and responding to this story.</p>]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Timbu.com — No copyright on homepage]]></title>
            <link>https://medium.com/@jeffogah/timbu-com-no-copyright-on-homepage-2021ba61243?source=rss-93f172144ac7------2</link>
            <guid isPermaLink="false">https://medium.com/p/2021ba61243</guid>
            <dc:creator><![CDATA[Jeffrey Ogah]]></dc:creator>
            <pubDate>Mon, 01 Apr 2019 19:44:04 GMT</pubDate>
            <atom:updated>2019-04-02T11:37:35.680Z</atom:updated>
            <content:encoded><![CDATA[<h3>Timbu.com — No copyright on homepage</h3><p>HNG Internship Stage 2 task was to find a bug on <a href="http://timbu.com/">http://timbu.com</a></p><p>This bug is in the footer section of the site, there is no visible copyright when visiting the site on a laptop.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*YE1nqzFhQEm97Z6TfhSssA.png" /><figcaption>No Copyright information shown</figcaption></figure><p>As seen above, there is no copyright in the footer section for the site.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=2021ba61243" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[HNG Internship 5]]></title>
            <link>https://medium.com/@jeffogah/hng-internship-5-2ec8ae0fd96a?source=rss-93f172144ac7------2</link>
            <guid isPermaLink="false">https://medium.com/p/2ec8ae0fd96a</guid>
            <category><![CDATA[developer]]></category>
            <category><![CDATA[design]]></category>
            <category><![CDATA[intership]]></category>
            <dc:creator><![CDATA[Jeffrey Ogah]]></dc:creator>
            <pubDate>Sat, 30 Mar 2019 15:22:34 GMT</pubDate>
            <atom:updated>2019-03-30T19:37:37.162Z</atom:updated>
            <content:encoded><![CDATA[<p>Hello there, today I took a big step in my Developer journey. I decided to sign up for HNG Internship 5. Few minutes in and it is already quite the bomb.</p><p>The first task was straightforward- familiarizing with git. Although I haven’t used it much so far, I know the basics at least.</p><p>The next task was to design a homepage with Figma! I have heard much about Figma but I’ve never used it before. I ventured to their site and started playing around. I’ve done some work in Adobe Photoshop, so it was easier to get into Figma. Better still, the functionality was impressive. It’s easy to get addicted to this and I can see why now. I can already tell this will become a major part of my work going forward.</p><p>In the meantime, here’s what I came up with in Figma:</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/654/1*L1uvLzyDTIWmFzzqZlZo1w.png" /></figure><p>Stay tuned for more details!</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=2ec8ae0fd96a" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>