<?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 Shams Nahid on Medium]]></title>
        <description><![CDATA[Stories by Shams Nahid on Medium]]></description>
        <link>https://medium.com/@shams-nahid?source=rss-ae6c9d4c2c21------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/1*EQbur3m5bMuyWfUm-y0thA.jpeg</url>
            <title>Stories by Shams Nahid on Medium</title>
            <link>https://medium.com/@shams-nahid?source=rss-ae6c9d4c2c21------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Sat, 21 Nov 2026 22:54:50 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@shams-nahid/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[Understanding the Common “display” Property Values in CSS]]></title>
            <link>https://shams-nahid.medium.com/understanding-the-common-display-property-values-in-css-b8e2920aeb2b?source=rss-ae6c9d4c2c21------2</link>
            <guid isPermaLink="false">https://medium.com/p/b8e2920aeb2b</guid>
            <category><![CDATA[front-end-development]]></category>
            <category><![CDATA[css3]]></category>
            <category><![CDATA[css]]></category>
            <category><![CDATA[frontend]]></category>
            <category><![CDATA[interview-questions]]></category>
            <dc:creator><![CDATA[Shams Nahid]]></dc:creator>
            <pubDate>Fri, 13 Sep 2024 12:23:18 GMT</pubDate>
            <atom:updated>2024-09-13T12:23:18.048Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*QNgTdSUUPjlQd-CCRen4KA.png" /></figure><p>In CSS, display is one of the most used CSS properties. As a value of display property, most commons are none, block, inline, inline-block and flex. Additionally, in different cases, grid, table, table-row, table-cell and list-item are used.</p><p>Responsibilities of these values are described below,</p><ul><li><strong>none</strong>: The current elements along with all its children will not be rendered in the browser</li><li><strong>block</strong>: Takes up the full width, forces a new line, and allows width/height to be set.</li><li><strong>inline</strong>: Takes up only as much width as needed, does not force a new line, and cannot have width/height set.</li><li><strong>inline-block</strong>: Combines the behavior of inline (doesn’t force a new line) and block (can have width/height set).</li><li><strong>flex</strong>: Use block-level flex container</li><li><strong>grid</strong>: Use block-level grid container</li><li><strong>table</strong>: Behaves like &lt;table /&gt; component</li><li><strong>table-row</strong>: Behaves like &lt;tr /&gt; component</li><li><strong>table-cell</strong>: Behaves like &lt;tc /&gt; component</li><li><strong>list-item</strong>: Behaves like &lt;li /&gt;</li></ul><p>Regarding flexbox and grid,</p><blockquote>Use flexbox for one dimentional simple layout. However for multi-dimentional complex layout, where both row and column needs to be managed, use grid layout.</blockquote><p>Understanding the display property and its various values is essential for crafting effective and responsive layouts. While simpler layouts benefit from inline, block, or flex, more complex, multi-dimensional layouts are best handled with the grid property. Choose the appropriate display value based on the layout requirements to create efficient and maintainable web designs.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=b8e2920aeb2b" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Understanding CSS Box Model]]></title>
            <link>https://shams-nahid.medium.com/understanding-css-box-model-655fd45ab507?source=rss-ae6c9d4c2c21------2</link>
            <guid isPermaLink="false">https://medium.com/p/655fd45ab507</guid>
            <category><![CDATA[interview-questions]]></category>
            <category><![CDATA[css]]></category>
            <category><![CDATA[html]]></category>
            <category><![CDATA[css-box-model]]></category>
            <category><![CDATA[styling]]></category>
            <dc:creator><![CDATA[Shams Nahid]]></dc:creator>
            <pubDate>Fri, 13 Sep 2024 08:51:11 GMT</pubDate>
            <atom:updated>2024-09-13T08:51:11.143Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*mXHnyrhW3xiGKQyGDLXMuw.png" /></figure><h3>Overview</h3><p>Box models are the core concept of CSS. We can define box models,</p><ul><li>Rectangular Box</li><li>Generated for the elements</li><li>Reside in the document tree</li></ul><p>Each of the CSS models has a content area along with the possible optional surroundings,</p><ul><li>Padding</li><li>Border</li><li>Margin</li></ul><blockquote>Now regarding margin, it is not included with the actual size of the box. Instead it grows outside the box. Only the padding and border are included with the box size</blockquote><h3>Rules</h3><p>The rules for the box-sizing,</p><ul><li>Box models are calculated by width, height, padding, and border</li><li>If no height is defined, it will take the height same as the content</li><li>If no width or max width is defined, it will take the width of the parent. A few exceptions are input, table, figure, span, etc.</li><li>The default value of the width is content-box. For the value content-border, the size of the box includes the padding and border.</li></ul><blockquote>Rules are not applicable for the float component.</blockquote><p>In conclusion, understanding the CSS box model is essential for precise layout control. By mastering properties like box-sizing, padding, border, and margin, you can effectively manage the size and spacing of elements on a webpage.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=655fd45ab507" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[House Robber: From recursion to memoization and ultimately space-optimized solution]]></title>
            <link>https://shams-nahid.medium.com/house-robber-from-recursion-to-memoization-and-ultimately-space-optimized-solution-52f2f448ee1b?source=rss-ae6c9d4c2c21------2</link>
            <guid isPermaLink="false">https://medium.com/p/52f2f448ee1b</guid>
            <category><![CDATA[dynamic-programming]]></category>
            <category><![CDATA[typescript]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[datastrucutre]]></category>
            <dc:creator><![CDATA[Shams Nahid]]></dc:creator>
            <pubDate>Thu, 12 Sep 2024 13:58:43 GMT</pubDate>
            <atom:updated>2024-09-12T13:58:43.277Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*I6ylmng9CIKiMS_txIO1cg.png" /></figure><p>One of the most popular dynamic programming problems is the famous house robber. If we narrow down the category, it is the pick or not pick problem. Based on the basics of house robber problem, a few more problems are available are out there by adding more layers of complexity.</p><p>Today, we will get the most basic problem and solve it step by step. We will start by using the recursion and later on top of the recursion problem, we will use the tabulation of dynamic programming. Finally, we will optimize the space.</p><p>The house robber problem is explained, as follows,</p><p>There are a few houses in a row and as a robber, I can not rob adjacent houses. This implies, if I rob house 1, I can not rob house 2. After house 1, I have to choose house 3 or 4 or so on. However, If I do not rob house 1, then I may rob house 2.</p><p>With this in our mind, the simplest solution is, to write a recursion and try all the possibilities.</p><h3>Recursion</h3><p>Recursion will be the brute force solution, where we will explore all the possibilities and figure out the maximum value. We can consider any of the sequences, from the first to the last index or vice-versa of the array. Here’s a solution, driving from the first to the last index.</p><pre>function rob(nums: number[]): number {<br>    const helper = (index) =&gt; {<br>        if (index &gt;= nums.length) {<br>            return 0;<br>        }<br>        const pick = nums[index] + helper(index + 2);<br>        const notPick = helper(index + 1);<br>       return Math.max(pick, notPick);<br>    }<br>    <br>    return helper(0);<br>};</pre><h3>DP Memoization</h3><p>Now, we can see the sub-problems, where, we may calculate the index multiple times using the function. Instead, to persist the already calculated value, we can consider an array dp of the array size.</p><pre>function rob(nums: number[]): number {<br>    const dp = new Array(nums.length).fill(-1);<br>    const helper = (index) =&gt; {<br>        if (index &gt;= nums.length) {<br>            return 0;<br>        }<br>        if (dp[index] !== -1) {<br>            return dp[index];<br>        }<br>        const pick = nums[index] + helper(index + 2);<br>        const notPick = helper(index + 1);<br>        dp[index] = Math.max(pick, notPick);<br>        return dp[index];<br>    }<br>    return helper(0);<br>};</pre><p>Now, if we already calculated the value, we skip the further calculation and get the calculated from the array.</p><p>We can calculate the the value from last to the first index as well as follows,</p><pre>function rob(nums: number[]): number {<br>    const dp = new Array(nums.length).fill(-1);<br>    const helper = (index) =&gt; {<br>        if (index === 0) {<br>            return nums[index];<br>        }<br>        if (index &lt; 0) {<br>            return 0;<br>        }<br>        if (dp[index] !== -1) {<br>            return dp[index];<br>        } <br>        const pick = nums[index] + helper(index - 2);<br>        const notPick = helper(index - 1);<br>        dp[index] = Math.max(pick, notPick);<br>        return dp[index];<br>    }<br>    return helper(nums.length - 1);<br>};</pre><h3>Tabulation</h3><p>If we observe closely, we can see, the base value of the recursion,</p><ul><li>If there is only one house, the result is the first house’s value</li><li>For the first two houses, the result is the maximum of the first two houses, since we can not take these consecutive two houses</li><li>For the rest of the houses, if we pick the house, just can not pick the immediate previous one</li></ul><p>Considering these, can calculate the final maximum results as below,</p><pre>function rob(nums: number[]): number {<br>    const dp = new Array(nums.length).fill(0);<br>    dp[0] = nums[0];<br>    dp[1] = Math.max(nums[0], nums[1]);<br>    for (let i = 2; i &lt; nums.length; i += 1) {<br>        const take = nums[i] + dp[i - 2];<br>        const notTake = dp[i - 1];<br>        dp[i] = Math.max(take, notTake);<br>    }<br>    return dp[nums.length - 1];<br>};</pre><h3>Space Optimization</h3><p>From the last solution, it occurs, that the solution of the current index only depends on the previous two values. With this consideration, we can simply avoid the entire O(n) array with just two variables,</p><pre>function rob(nums: number[]): number {<br>    let rob1 = 0;<br>    let rob2 = 0;<br>    for (let i = 0; i &lt; nums.length; i += 1) {<br>        const take = rob1 + nums[i];<br>        const notTake = rob2;<br>        rob1 = rob2<br>        rob2 = Math.max(take, notTake)<br>    }<br>    return rob2;<br>};</pre><p>This is the most optimized solution with constant space and O(n) runtime complexity.</p><p>For practice: <a href="https://leetcode.com/problems/house-robber/">https://leetcode.com/problems/house-robber/</a></p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=52f2f448ee1b" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Fibonacci Number: From recursion to memoization and ultimately space-optimized solution]]></title>
            <link>https://shams-nahid.medium.com/fibonacci-number-from-recursion-to-memoization-and-ultimately-space-optimized-solution-0356c7157124?source=rss-ae6c9d4c2c21------2</link>
            <guid isPermaLink="false">https://medium.com/p/0356c7157124</guid>
            <category><![CDATA[dynamic-programming]]></category>
            <category><![CDATA[typescript]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[datastrucutre]]></category>
            <category><![CDATA[javascript]]></category>
            <dc:creator><![CDATA[Shams Nahid]]></dc:creator>
            <pubDate>Tue, 10 Sep 2024 14:04:19 GMT</pubDate>
            <atom:updated>2024-09-10T14:04:19.659Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*Dw8NTdSS-2cisA8lTKRmfA.png" /></figure><p>Let’s evaluate the Classic Dynamic Programming problem, Fibonacci Number in a crispy way.</p><p>We will start solving the problem from a recursive solution and later step by step we will use memoization and space optimization.</p><p>The Fibonacci Number or Fibonacci Sequence is as follows,</p><p>0, 1, 1, 2, 3, 5, 8, 13 and so on.</p><p>After the first two numbers, each number is the sum of the previous two numbers.</p><h3>Recursive Solution</h3><p>So, the constant part of the base case of the sequence is first two numbers are always 0 and 1. To calculate the rest of the numbers we will consider,</p><pre>f(n) = f(n - 1) + f(n - 2)</pre><p>With the base case and driven formula, our recursive solution will be,</p><p>Copy</p><pre>function fibonacciNumber(n: number): number {<br>    const dp = new Array(n + 1).fill(-1);<br>    const helper = (step) =&gt; {<br>        if (dp[step] !== -1) {<br>            return dp[step];<br>        }<br>        if (step === 0 || step === 1) {<br>            return step;<br>        }<br>       const first = helper(step - 1);<br>        const second = helper(step - 2);<br>        dp[step] = first + second;<br>        return dp[step];<br>    }<br>    return helper(n);<br>};</pre><p>This is a bottom-up approach. However, if we go to a tabulation format, we can design a top-to-bottom approach.</p><h3>Memoization</h3><p>We are maintaining an array dp where we are keeping the sequence number. After the first two values, the next one is the sum of the previous two values. In a more simplified way, we can say,</p><pre>dp[n] = dp[n - 1] + dp[n - 2]</pre><p>Now, the first two values are known and we will update these two values initially. Then with a simple loop we will calculate the rest of the sequence.</p><pre>function fibonacciNumber(n: number): number {<br>    const dp = new Array(n + 1);<br>    dp[0] = 0;<br>    dp[1] = 1;<br>    for (let i = 2; i &lt;= n; i += 1) {<br>        dp[i] = dp[i - 1] + dp[i - 2];<br>    }<br>    return dp[n];<br>};</pre><p>With the implementation, we can see the space complexity is O(n). With this in mind, can we do more space optimization?</p><h3>Space Optimization</h3><p>Since each of the values just depends on the previous two values, we can just keep these previous two values and calculate the current one.</p><pre>function fibonacciNumber(n: number): number {<br>     if (n &lt; 2) {<br>        return n;<br>    }<br>    let prev1 = 0;<br>    let prev2 = 1;<br>    for (let i = 2; i &lt;= n; i += 1) {<br>        const temp = prev2;<br>        prev2 = prev1 + prev2;<br>        prev1 = temp;<br>    }    <br>    return prev2;<br>};</pre><p>With these constant values, we can now optimize the space to O(n)</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=0356c7157124" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Agargaon Night Half Marathon]]></title>
            <link>https://shams-nahid.medium.com/agargaon-night-half-marathon-df0583eceea0?source=rss-ae6c9d4c2c21------2</link>
            <guid isPermaLink="false">https://medium.com/p/df0583eceea0</guid>
            <category><![CDATA[running]]></category>
            <category><![CDATA[half-marathon]]></category>
            <category><![CDATA[bangladesh]]></category>
            <dc:creator><![CDATA[Shams Nahid]]></dc:creator>
            <pubDate>Sun, 19 May 2024 05:48:14 GMT</pubDate>
            <atom:updated>2024-05-19T05:48:14.235Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*zp1S2SY_EtL9TB1uXLKEtg.jpeg" /></figure><p>The Agargaon Half Marathon was the first running event of the summer season in 2024. A few months back, when the event was announced, we all expected very hot weather, high humidity, or thunderstorms. Despite these extreme weather conditions, there was a huge rush to participate. In about an hour, all the slots were booked. I was one of the lucky ones to register myself in the first chance. However, after fulfilling the first 500 slots, due to high demand, an additional 100 slots were opened.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*DyM_6RPvVnlmMEV5T_ltuw.jpeg" /></figure><p>The most special aspect of this event was that it was a night run. Usually, we are used to participating in morning or daytime runs. This one started at 1 AM. Additionally, it was only a 20-minute walking distance from my neighborhood, so I did not want to miss the event.</p><p>A month before the event, we observed fasting for religious reasons. I had one month to prepare. I used to run slowly, covering 20–25 km a week. It turns out that was not enough.</p><p>During the race, I started very slowly, just jogging. We had four loops of 5 km and one very small loop, around 1.5 km. I completed three loops, totaling 12 km, with slow running. Later, I did not feel well and started walking. For the rest of the track, I alternated between walking and running 1 km each.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*lm-GqKSuGY2VSOwJL8IGtQ.jpeg" /></figure><p>I took more than three hours to complete the run, whereas my best time was 2 hours and 18 minutes. This event highlighted my weaknesses, particularly my lack of endurance. I have now started a 10-week training program to increase my endurance.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=df0583eceea0" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Vertical Dreamers 25k & Finally Unlocaked Kutubdia]]></title>
            <link>https://shams-nahid.medium.com/vertical-dreamers-25k-finally-unlocaked-kutubdia-6dfb0e1bb47d?source=rss-ae6c9d4c2c21------2</link>
            <guid isPermaLink="false">https://medium.com/p/6dfb0e1bb47d</guid>
            <category><![CDATA[marathon]]></category>
            <category><![CDATA[solo-travel]]></category>
            <category><![CDATA[travel]]></category>
            <category><![CDATA[bangladesh]]></category>
            <category><![CDATA[running]]></category>
            <dc:creator><![CDATA[Shams Nahid]]></dc:creator>
            <pubDate>Thu, 29 Feb 2024 07:35:12 GMT</pubDate>
            <atom:updated>2024-02-29T07:35:12.451Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*XnGx_sgYo-D0IPEEU3ncXg.jpeg" /></figure><p>In Bangladesh, the Vertical Dreamers 25k is one of three prestigious events. Before this particular race, I had a two-week rest from the intense running month. Although there were two categories of running, 25k and 52k ultra, I chose to go for the 25k due to the insane elevation on the track. Initially, it was supposed to happen on the Alikodom-Thanchi road, beside Dimpahar. However, due to political issues near the Myanmar border, the track was relocated to the Bandarban Chimbuk road.</p><p>When It was about to happen in the Alikodom, I knew I could not participate as I had an office meeting the previous day. However, when the location changed, I decided to take the shot towards an uncertain journey to reach the Bandarban. Previously I visited Bandarban over 15 times, so I know some routes, so I can reach to the city before 3 AM.</p><p>I reached Bandarban very early in the morning, around 2 am. There, I collected my BIB and then encountered some familiar faces.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*Q9ViLzXdaxTGwWy8" /></figure><p>One of my previous running partners was already there, and we surprisingly had a similar pace. So, we started running together. At around 3 km, we reached a U-turn leading to a hill. Although it was physically devastating, the natural beauty was serene. I encountered another mind-blowing view during the last U-turn.</p><p>My partner experienced muscle cramps twice and received long massages twice at two hydration points. Overall, it took us around 4 hours and 30 minutes.</p><p>After collecting the medal, I opted to visit Kutubdia Island. I had previously tried twice to go there, but due to very bad weather, I was unable to reach it. This time, the weather was nice, and I went there by a small boat. It is famous for its lighthouse and windmills. Although the lighthouse was broken, the windmills were still standing.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*54JI3WEeoHODQl6n" /></figure><p>This race day adventure was not just another running event. The hill track was exceptionally challenging but worth every bit. Additionally, I enjoyed utilizing the second day on a nice island.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=6dfb0e1bb47d" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Prepare for your first AWS Certification]]></title>
            <link>https://shams-nahid.medium.com/prepare-for-your-first-aws-certification-01a10fcbdd3d?source=rss-ae6c9d4c2c21------2</link>
            <guid isPermaLink="false">https://medium.com/p/01a10fcbdd3d</guid>
            <category><![CDATA[aws-solution-architect]]></category>
            <category><![CDATA[aws]]></category>
            <category><![CDATA[aws-certification]]></category>
            <category><![CDATA[amazon-web-services]]></category>
            <category><![CDATA[aws-developer-associate]]></category>
            <dc:creator><![CDATA[Shams Nahid]]></dc:creator>
            <pubDate>Thu, 22 Feb 2024 10:16:46 GMT</pubDate>
            <atom:updated>2024-02-22T10:16:46.586Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*FJPaB3tvo1cjvPHiOSvHcQ.png" /></figure><p>If you are in a developer/engineering role and have decided to pursue your first <a href="https://aws.amazon.com/certification/">AWS</a> certification, I am here to assist you with the following:</p><ul><li>Choosing the right certification</li><li>Identifying the courses/resources you will need</li></ul><p>In most cases, the first confusing part of certification for engineers/developers is whether to go for <a href="https://aws.amazon.com/certification/certified-solutions-architect-associate/">Solution Architect Associate</a> or <a href="https://aws.amazon.com/certification/certified-developer-associate/">Developer Associate</a>.</p><p>Now, some of you may wonder why I did not consider AWS Cloud Practitioner. There are two reasons for this:</p><ul><li>This Cloud Practitioner certification suits marketing roles more than developer roles.</li><li>I assume you are a developer who has been using AWS services for at least a year.</li></ul><p>Now, before you proceed, this article is not suitable for you if:</p><ul><li>You are not using AWS services regularly.</li><li>You are more interested in obtaining a certificate than gaining hands-on experience.</li></ul><p>Assuming you are still here, the perspective of having a certificate is to validate your existing knowledge. One key point to remember is that while you validate your knowledge, AWS acts as a marketing agent to sell its products and services.</p><p>Before we proceed further, what are my credentials to write this article? Okay,</p><ul><li>I hold two AWS certificates (Both AWS CSAA and CDA).</li><li>I am a senior software engineer with over 5 years of experience.</li></ul><h3>Which certificate should I go for?</h3><p>For the first certificate, we have two options, both at the associate level:</p><ul><li>AWS Certified Solution Architect — Associate (CSAA)</li><li>AWS Certified Developer — Associate (CDA)</li></ul><p>Now, although in my case, I took the CSAA first, I encourage you to go for CDA.</p><p>Reasons why I discourage going for CSAA:</p><ul><li>It requires knowledge of networking to a certain degree.</li><li>Comparing study content, it is larger than the CDA.</li><li>Challenges knowledge on migrating on-premise services to AWS Clouds, which is not a regular job for a developer role.</li><li>Tons of hands-on work on the AWS console.</li></ul><p>And why I prefer CDA for the first certification:</p><ul><li>This includes serverless services, which are pretty common for developer roles, as we use them in on-premise servers.</li><li>Most of the hands-on work is related to existing development tasks.</li><li>We have already used most of the tools and services in open-source versions (or from different vendors).</li></ul><p>Overall, as developers, we use a lot of open-source tools/services. In the CDA exam, we will become familiar with the AWS versions of these tools. For example, for CI/CD, we use Jenkins, GitHub Actions, Travis CI, etc. Here, we will find the AWS versions of these tools. In our daily jobs, we develop APIs, build UIs, and deploy them. In the course curriculum, we will get used to AWS services for these tasks.</p><p>So AWS CDA is not just comparatively easier but also an interesting choice for the first certification.</p><p>However, if you are involved in building infrastructure, managing security, handling networking stuff rather than raw coding, I would suggest going with AWS CSAA first.</p><h3>Courses/Resources</h3><p><a href="https://courses.datacumulus.com/">Stephane Maarek</a>, <a href="https://digitalcloud.training/">Neal Davis</a>, <a href="https://learn.cantrill.io/p/home">Adrian Cantrill</a>, <a href="https://tutorialsdojo.com/">Jon Bonso</a>, <a href="https://www.whizlabs.com/">Wizlab</a> have created great resources for both CDA and CSAA certifications. However, if you want a bold outline with minimum resources, you can go with the following:</p><p><strong>Courses for AWS CDA</strong></p><ul><li>Video course from Stephane Maarek: <a href="https://www.udemy.com/course/aws-certified-developer-associate-dva-c01/">Ultimate AWS Certificate Developer — Associate</a></li><li>Practice Exam from John Bonso: <a href="https://tutorialsdojo.com/courses/aws-certified-developer-associate-practice-exams/">AWS CERTIFIED DEVELOPER ASSOCIATE PRACTICE EXAMS</a></li></ul><p><strong>Courses for AWS CSAA</strong></p><ul><li>Video course from Stephane Maarek: <a href="https://www.udemy.com/course/aws-certified-developer-associate-dva-c01/">Ultimate AWS Certificate Solution Architect — Associate</a></li><li>Practice Exam from John Bonso: <a href="https://tutorialsdojo.com/courses/aws-certified-developer-associate-practice-exams/">AWS CERTIFIED SOLUTION ARCHITECT ASSOCIATE PRACTICE EXAMS</a></li></ul><h3>Tips</h3><p><strong>Video Course</strong></p><p>Video courses are the most boring but impactful resource for the exam. Personally, I could not concentrate for more than 5 minutes on video tutorials. To reduce this issue, I did the following:</p><ul><li>Ran these videos at 1.5x speed</li><li>Paused and took personalized notes</li><li>Went to the AWS console and played with the services</li><li>Tried practice exams and to clarify specific exam topics watched the related video (or video section)</li></ul><p><strong>Practice Exam</strong></p><p>Practice exams help identify the boundaries of the course. When I found multiple questions on a single topic, I put additional concentration on these topics’ video courses.</p><p>During practice, even if you are sure about the answers, read the explanation part to learn additional information about the services.</p><p>In my real exam, I found around 10 questions pretty close to the practice exam. Although the practice exams are comparatively more challenging than the original exam, try to revisit them until you score over 80% in each exam.</p><h3>Hands-On</h3><p>Hands-on experiences are the keys to learning, experimenting, and memorizing the services. For CSAA, the most important hands-on part is creating a custom VPC that includes public and private subnets. Run servers in these subnets along with ALB, ASG, IG, NAT Gateway. This will help to cover a major portion of the syllabus.</p><p>For CDA, build a serverless application with SAM, API Gateway, Lambda, and DynamoDB. Use Code Pipeline to deploy code to the EC2 instance (or Beanstalk) using Code Build and Code Deploy. Play with different deployment configurations. This will not just cover the exam syllabus but also keep the certification journey interesting.</p><h3>Conclusion</h3><p>This is a personal opinion based on my journey with these two certifications. For queries, comment below or shoot me an email. Good luck on your cloud journey.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=01a10fcbdd3d" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[200 KM Running In 30 Days: Did I cross my limit?]]></title>
            <link>https://shams-nahid.medium.com/200-km-running-in-30-days-did-i-cross-my-limit-7554615fa3b1?source=rss-ae6c9d4c2c21------2</link>
            <guid isPermaLink="false">https://medium.com/p/7554615fa3b1</guid>
            <category><![CDATA[ultramarathon]]></category>
            <category><![CDATA[running]]></category>
            <category><![CDATA[marathon]]></category>
            <category><![CDATA[fitness]]></category>
            <category><![CDATA[bangladesh]]></category>
            <dc:creator><![CDATA[Shams Nahid]]></dc:creator>
            <pubDate>Thu, 15 Feb 2024 20:08:22 GMT</pubDate>
            <atom:updated>2024-02-15T20:08:22.617Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*SeSnDKDUP3ferghuLxQK5g.png" /></figure><p>In the last 30 days, I participated.</p><ul><li><a href="https://blog.shams-nahid.com/conquering-ultra-marathon-im-not-surprised">Marine Drive Ultra Marathon</a> (50 KM)</li><li><a href="https://blog.shams-nahid.com/the-dhaka-marathon-2024">Dhaka Marathon</a> (42 KM)</li><li><a href="https://blog.shams-nahid.com/rajkandi-hill-25k-a-surprising-track">Rajkandi Hill 25K</a> (25 KM)</li><li><a href="https://blog.shams-nahid.com/ucr-half-marathon-end-of-a-super-intense-month">UCR Half Marahon</a> (21 KM)</li><li>And in-house practice 100 KM</li></ul><p>As I am going through the recovery training, I wonder, did I push myself beyond my limits?</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*FklR6xMrNDy-50FQ" /></figure><h3>Marine Drive Ultra Marathon</h3><p>It all started with the <a href="https://blog.shams-nahid.com/conquering-ultra-marathon-im-not-surprised">Marine Drive Ultra Marathon</a>. Before this one, I never run a full marathon. Since it is one of the most prestigious events for runners and not easy to be selected for the program, I registered with no hope of getting a chance. To my surprise, I was selected for my previous month’s consistency. I wrote them in detail, I participated in 7/8 half marathons in the past few months and I am capable of running this ultra distance.</p><p>After being selected, I started to run ~15 KM 3 days a week. My target was to increase my endurance so I could stay on track for over 8 hours. Usually, the cut-off time for 50 KM used to be 10 hours which was reduced this year to 8 hours. The week before the run, I stopped running and only did free training. It was one of these feelings, I practiced my best and there was nothing more I could do. No matter, if I can complete it or not, there will be no regret.</p><p>During the run day, I started slowly and on the track, I found a partner with the same pace. Or I should say, I found a mathematician. He opened the Strava app and calculated each KM with the time. We were together the entire 50 KM and his precious calculation helped me to complete the run in the cut-off time.</p><p>I went around 35 KM pretty much comfortably and after 35 KM I mixed both running and walking to the rest of the track. The amazing part was kids were standing by the side of the road and giving high-fives all the way.</p><p>I completed the run around 7 and a half hours duration. It was a mixed feeling when you saw lots of good runners who were not able to complete the run under the cut-off time for different challenges. Because this also glorifies the achievement.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*bZ28CIccOZvnvr5g" /></figure><h3>Dhaka Marathon</h3><p>In the immediate next week, there was the <a href="https://blog.shams-nahid.com/the-dhaka-marathon-2024">Dhaka Marathon</a>. I was not quite confident about this run. Although my muscle memory now has a distance of 50 KM I have not completely recovered from the last Ultra distance run. In Bangladesh, a full marathon is not very frequent and I was desperate to put a full marathon in my resume.</p><p>Leaving all the confusion behind, I decided to participate in the event. For the first 21 KM, I run quite easily at a slow pace. This time the cut-off time was 6 hours. As I recall, I completed half of the distance in under 2 hours and 23 minutes. I kept the same pace till 30 KM. I had around 2 hours left for the last 10 KM. Since I run previous week a long distance and in the upcoming weeks I have a couple of running events, I did not push myself. I kept my heart calm by running and walking.</p><p>This time, I completed the full marathon in around five and a half hours. The consequence of two consecutive long-distance runs injured my left foot.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*feqz7QX-0hZ83veM" /></figure><h3>RajKandi Hill 25K</h3><p>In Bangladesh, <a href="https://blog.shams-nahid.com/rajkandi-hill-25k-a-surprising-track">Rajkandi Hill 25K</a> is the most beloved running event. Not only it is organized by the dedicated community runners, but also the track surprises the runners every 5 KM.</p><p>I was not fit to run this event due to the left foot injury. But hearing the stories from fellow runners about the track could not resist myself. This week, I did not practice and slept a lot. I was worried this time If I would be able to complete this hill track.</p><p>On the run day, surprisingly I was feeling very good. On the track, we started running in the rice field. Later, the track was going through the tea garden of the Dankan Brothers. The surprises start after the tea garden. There were rubber gardens on the hills and our tack was under these large rubber trees. Then comes the cascade all over the track. At the end of the run, I found a hill, that will be around 300 meters high.</p><p>All these beauties of the track and support from the locals made the run very easy and I completed the run in around three and a half hours.</p><p>We also visited few places in the Sylhet region after the run.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*kSC7EN8a9uJhJSak" /></figure><h3>UCR Half Marathon (Edition 2)</h3><p>Again, this is the event I should not participate in as I have not recovered yet. However, since I was in Dhaka I would retreat not participate in the event in terms of staying home idle during the weekend. So I decided to participate <a href="https://blog.shams-nahid.com/ucr-half-marathon-end-of-a-super-intense-month">UCR Half Marahon</a> before going into a long recovery training.</p><p>The best part was, I found the best pacer in BD with a close time to my target. I planned to complete the run in under 2 and a half hours. Since the pacer had a time of 3 hours, I decided to accompany him around 10–15 KM and then push myself. Since I was not completely fit this time, I started to struggle after 10 KM. After half of the distance, my leg, especially my injured left foot cramped a few times. This time, I could not walk because walking was causing more pain than running.</p><p>Along with the pain, I never left the pacer bus and after 15 KM pushed myself to my regular pace. This time, I met my personal best in half marathon distance, 2 hours and 27 minutes.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*ISYMg8hDsyW4Nv5A" /></figure><h3>Back To The Answer</h3><p>So, back to my early question, did I cross my limit? I thought and it appeared to me, we can never cross our limit because the term “LIMIT” does not exist in this context.</p><p>I am under recovery training and in the next month, I will be back on track. Till then, signed off.</p><p>To stay tuned, check out my running blog series <a href="https://blog.shams-nahid.com/series/rising-beyond-miles">Rising Beyond Miles</a>.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=7554615fa3b1" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[Scalable Design of a Mapping Application]]></title>
            <link>https://shams-nahid.medium.com/scalable-design-of-a-mapping-application-3c1ed18de183?source=rss-ae6c9d4c2c21------2</link>
            <guid isPermaLink="false">https://medium.com/p/3c1ed18de183</guid>
            <category><![CDATA[system-design-interview]]></category>
            <category><![CDATA[google-maps]]></category>
            <category><![CDATA[system-design-concepts]]></category>
            <category><![CDATA[software-architecture]]></category>
            <category><![CDATA[high-level-design]]></category>
            <dc:creator><![CDATA[Shams Nahid]]></dc:creator>
            <pubDate>Thu, 15 Feb 2024 05:02:32 GMT</pubDate>
            <atom:updated>2024-02-15T05:02:32.430Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*1hRZghn3bXcra1NXNDDRwQ.png" /></figure><p>A mapping application stores and manages millions of road data to accurately navigate individual users and applications. For example, the Google Maps application processes billions of nodes and edges to guide people all over the world. A feature reach mapping application serves both individuals and companies.</p><p>For individuals:</p><ul><li>Allow searching tracks from source to destination.</li><li>Allow direction on the track.</li><li>Show the ETA (estimated time of arrival).</li></ul><p>For companies:</p><ul><li>Allow driving the self-driving cars (Waymo’s self-driving car).</li><li>Allow ride-sharing services (Lyft).</li><li>Allow parcel services (Uber).</li></ul><h3>Requirements</h3><h4>Functional Requirements</h4><ul><li><strong>Detect the current location:</strong> It requires finding out the latitude and longitude of the current location. This is the basis for providing other services.</li><li><strong>Provide a route:</strong> According to the source and destination, the application should provide multiple faster routes based on the vehicles.</li><li><strong>Directions:</strong> On the way from the source to the destination, the app will guide users in the right direction.</li></ul><h4>Non-Functional Requirements</h4><ul><li><strong>Availability:</strong> The system should be highly available.</li><li><strong>Scalability:</strong> The system should be scalable as both individuals and enterprise applications like Uber, Lyft, Waymo, etc., use the application internally.</li><li><strong>Performance:</strong> This includes the accuracy and latency of finding and providing routes.</li></ul><h4>Challenges</h4><ul><li><strong>Scalability:</strong> The map application will be dealing with billions of nodes and edges when finding the path all over the world. Typical pathfinding algorithms like Dijkstra’s algorithm will not scale to this volume and may provide a poor experience. We will require a modified and improved version of the algorithm.</li><li><strong>ETA Computation:</strong> The ETA should consider different factors like road constructions, traffic volumes, and different incidents on the way to the destination and update accordingly.</li></ul><h4>Resource Estimation</h4><p>Let’s consider the map application has a total of 30 million daily users.</p><p><strong>Servers:</strong></p><p>If a single server can handle 8000 requests per second, and a user makes 50 requests per day, we will make a total of (50 <em>30 </em>10⁶) requests per day.</p><p>This implies (50 <em>30 </em>10⁶) / (24 <em>60 </em>60) requests per second.</p><p>TOTAL_REQUEST_PER_DAY = (50 <em>30 </em>10⁶) / (24 <em>60 </em>60);</p><p>Total servers we will need is (TOTAL_REQUEST_PER_DAY/8000).</p><p><strong>Storage:</strong></p><p>Storage requirement for the map is pretty much consistent. Reading route data from various sources is persisted for one time.</p><p><strong>Bandwidth:</strong></p><p>Based on the following assumptions:</p><ul><li>Total active users: 30 million</li><li>Each user makes 50 requests per day</li><li>Each request size is 200 bytes</li><li>Each response size will be 2050 bytes</li></ul><p>Incoming Bandwidth:</p><p>INCOMING_BANDWIDTH = ((TOTAL_ACTIVE_USERS <em>REQUEST_PER_DAY_BY_EACH_USER </em>EACH_REQUEST_SIZE) / 24_HOURS_IN_SECONDS) bytes/s</p><p>In numbers: (30 <em>10⁶ </em>50 <em>200) / (24 </em>60 * 60) bytes/s</p><p>Outgoing Bandwidth:</p><p>Unlike the incoming request, the response will have both textual and visual content to build up a map.</p><p>OUTGOING_BANDWIDTH = ((TOTAL_ACTIVE_USERS <em>REQUEST_PER_DAY_BY_EACH_USER </em>EACH_RESPONSE_SIZE) / 24_HOURS_IN_SECONDS) bytes/s</p><h4>Building Blocks</h4><p><strong>Load Balancer:</strong> To distribute traffic between different services and servers. <strong>Database:</strong> To store the location data and metadata in graph format. <strong>Pub-Sub System:</strong> Navigate users on the right directions and also invoke related services. <strong>Key-Value Storage:</strong> Also, store the metadata information.</p><h3>High-Level Design</h3><h4>Components</h4><ul><li><strong>Location Finder:</strong> Reads the user’s current position. May use GPS/WIFI/Cellular technology to find out the current accurate location.</li><li><strong>Distributed Search:</strong> This determines the latitude and longitude of a place entered by the user. It’s a mapping service that translates the place name to the latitude and longitude.</li><li><strong>Route Finder:</strong> Using two positions, will generate all possible routes.</li><li><strong>Graph Processing Service:</strong> Between multiple routes, will determine the optimal route.</li><li><strong>Area Search Service:</strong> Orchestrates the distributed search, route finder, and graph processing service. At any time, using two places, get the actual position by invoking the distributed search. From these two locations, find the routes using the route finder. Later, use the graph processing service to get the optimal route.</li><li><strong>Database:</strong> Stores the routes, nodes, and edge data. Perhaps, utilize the graph database like DataStax.</li><li><strong>Pub-Sub System:</strong> While the user moves through the route, to navigate and guide, the pub-sub model will be used.</li><li><strong>Third-Party Data Receiver:</strong> Gets data from various sources about city, roads, and places. Pre-processes the third-party data so later these data can be used to store in the DB in native graph format.</li><li><strong>Graph Building:</strong> Graph building will be used to store the route data in the graph database that is suitable for making queries.</li><li><strong>User:</strong> The programs and people who are using the service.</li><li><strong>Load Balancer:</strong> Used to distribute traffic between different servers and services.</li></ul><h4>Workflow</h4><ul><li>User enters the source (uses location finder for current location) and destination.</li><li>The area search service will find the optimal route using distributed search, route finder, and graph processing service.</li><li>Navigator will track the user’s route. In case of distraction, the navigator will send an event to Kafka. Upon receiving the event, Kafka will recalculate the route using the area search service and send it back.</li></ul><h4>API Design</h4><ul><li>Current location: Returns the user’s current location.</li><li>Get route: Based on source, destination, and transport type, return the optimal route.</li><li>Get direction: At any point in time, based on the current location, give the next steps.</li></ul><h3>Challenges of Google Map Design</h3><h4>Scalability</h4><p>We have a mesh of billions of nodes and edges. When we need to calculate the shortest path between two nodes, we cannot simply run the shortest path algorithm on the entire graph. Because, first of all, it is both impractical and impossible to load the entire nodes and edges into memory. Additionally, it will lead to performance issues for the users. Instead, we can divide the graph into different small segments. This will lead to:</p><ul><li>Smaller polygons to calculate the shortest path.</li><li>We can query them in parallel, improving performance.</li></ul><p><strong>Segment</strong></p><p>Calculate the shortest path between two nodes in a single segment:</p><ul><li>In a single segment, there will be a weight between each edge that connects two nodes.</li><li>Weight will be calculated by the traffic density, average speed of the vehicles, and other criteria.</li><li>Load the segment in memory and run the regular shortest path algorithm like Dijkstra.</li><li>Cache the results to reuse in the future.</li></ul><p>Calculate the shortest path between two places that are not nodes:</p><ul><li>Calculate the nearest nodes from the point of edge.</li><li>Use the shortest path using these nodes.</li></ul><p>Calculate the shortest path when the source and destination are from different segments:</p><ul><li>We will use the term ‘Exit Point’, where an exit point is the connecting point between two segments.</li><li>Exit points will be shared by two or more segments.</li><li>Using latitude and longitude, we can find the source and destination segments.</li><li>Instead of going to all the segments, we will use a radius of approximate distance and discard any segment outside the radius during path computation.</li><li>While finding the shortest path over segments, we only consider the exit point and do not consider the internals of the segments.</li><li>For finding the shortest</li><li>segments path, we will do the rest of the computation inside the segments.</li></ul><h4>ETA Computation</h4><ul><li>Using the pub-sub model, the navigation service will collect live location data.</li><li>Considering the current location, traffic density (high, medium, low), traffic pattern (rush hour or not), find out the ETA.</li></ul><h3>Detailed Design of Google Maps</h3><h4>Segment Setup and Request Handling</h4><p><strong>Storage schema</strong></p><p>We will use 3 types of data storage:</p><ul><li>Key-value store</li><li>Graph database</li><li>Relational database</li></ul><p>After generating a segment, we will store the segment id and nodes (along with the edge) in the graph database.</p><p>We will utilize the key-value store to store the segment server id (where the segment is stored), boundaries (or exit points), and neighbor segment ids against the segment id.</p><p>In the traditional relational database, we will keep the information of the edges like weight, their traffic rush hours, and the related segment and node id.</p><p><strong>Design/Create Segment</strong></p><ul><li>First, get the data of the segment and get a segment id by a UUID generator.</li><li>Store the segment in the server using a ‘server allocator service’.</li><li>Now we have saved the segment with the segment id.</li><li>Create the key-value store using segment id and its boundaries, neighbors, and server id.</li><li>Insert the edges’ information of the segment into the relational database.</li></ul><p><strong>Handle User Request</strong></p><ul><li>When the user gives us the source and destination, find the latitude and longitude using the ‘distributed search’ service.</li><li>Find out the source and destination segments from the graph database.</li><li>Find all the relevant neighbors/segments using a radius.</li><li>The ‘route finder’ will find all the optimal routes using these segments.</li><li>The ‘graph processing service’ will find the appropriate route from the list of optimal routes.</li></ul><h4>Improve estimation using live data</h4><ul><li><strong>Web-socket &amp; Load-balancer</strong>: Using the WebSocket, the server can do two-way communication. A load balancer can be used to limit the number of socket connections on the server.</li><li><strong>Pub-Sub</strong>: The pub-sub model collects the data streams and puts them into a data analytics service like Apache Spark. The ‘map update service’ listens to the analytics result and updates the data storage.</li></ul><h4>Performance</h4><p>Our target is:</p><ul><li>The system can handle millions of user requests.</li><li>The system can handle a large amount of data.</li></ul><h4>Availability</h4><ul><li>Instead of storing the graph on a single server, we are utilizing individual servers for each segment.</li><li>This will help load the relevant segment into memory and query; otherwise, loading the entire graph will lead to out-of-memory errors.</li><li>We will utilize lazy loading so only relevant segments will load up in memory.</li></ul><h4>Scalability</h4><ul><li>Since we load segments only based on user requests, we can scale to a degree.</li><li>Also, for more segment data, we will utilize more servers that will not degrade individual server performance.</li></ul><h4>Reduce response</h4><ul><li>We will query smaller subgraphs (only relevant segments).</li><li>Cache the results of the query.</li></ul><h4>Accuracy</h4><ul><li>Use live location from the user to guide accordingly.</li><li>Update the edge weight based on traffic patterns.</li></ul><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=3c1ed18de183" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[UCR Half Marathon: End of a super intense month]]></title>
            <link>https://shams-nahid.medium.com/ucr-half-marathon-end-of-a-super-intense-month-9a07b2d39c12?source=rss-ae6c9d4c2c21------2</link>
            <guid isPermaLink="false">https://medium.com/p/9a07b2d39c12</guid>
            <category><![CDATA[marathon]]></category>
            <category><![CDATA[bangladesh]]></category>
            <category><![CDATA[running]]></category>
            <dc:creator><![CDATA[Shams Nahid]]></dc:creator>
            <pubDate>Wed, 14 Feb 2024 09:31:39 GMT</pubDate>
            <atom:updated>2024-02-14T09:31:39.168Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*uKtLFNucmwkzz5uAvEERVw.jpeg" /></figure><p>I was not completely prepared for this half marathon. Even the Rasjkandi Hill 25K was troublesome for me. In the last three weeks, I ran an ultra-marathon, a full marathon, and then 25 kilometers over the hills. Instead of making an immediate decision, I waited until the last day before the event. Fortunately, the day before the event, I felt good and decided to take the shot.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*jJNVRVGZpylxGO6a" /></figure><p>I reached the raceground quite early, around 4:30 PM. I collected the kit; however, the jersey was not available by then. In about an hour, I found some familiar faces and had some conversations about the previous events.</p><p>The starting point of the 21KM race was 1.5 KM away from the raceground. After reaching there, I found my favorite pacer. He was aiming to complete the run in 2 hours and 40 minutes. My plan was to run with him for at least 1 hour and later, if possible, increase the speed.</p><p>During the run, we discussed a lot of things, including the motive behind the run. It was great to hear the different backgrounds of other runners and their initial inspirations. All the way, he guided us with stepping and breathing instructions.</p><p>After crossing 15 KM, I decided to push myself further. Until that date, my personal best for the half marathon was 2 hours and 33 minutes. This time, I reduced it by 6 minutes, achieving a new personal best.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/0*fpQN3tQ6aiUzhNy4" /></figure><p>After the run, I met a few fellow runners, collected the medal, food, and returned home.</p><p>This was the last event of my intense month of running. Now, I am focusing on recovery training and will continue with recovery exercises until the end of the month.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=9a07b2d39c12" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>