<?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 kalema ronald on Medium]]></title>
        <description><![CDATA[Stories by kalema ronald on Medium]]></description>
        <link>https://medium.com/@kalemar8?source=rss-48c901f8b655------2</link>
        <image>
            <url>https://cdn-images-1.medium.com/fit/c/150/150/0*q9Oav0L5kMRrlH4O</url>
            <title>Stories by kalema ronald on Medium</title>
            <link>https://medium.com/@kalemar8?source=rss-48c901f8b655------2</link>
        </image>
        <generator>Medium</generator>
        <lastBuildDate>Wed, 18 Nov 2026 16:46:15 GMT</lastBuildDate>
        <atom:link href="https://medium.com/@kalemar8/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[Asynchronous Programming in JavaScript: What You Need to Know about Promises.]]></title>
            <link>https://medium.com/@kalemar8/asynchronous-programming-in-javascript-what-you-need-to-know-about-promises-bd108b1c9bab?source=rss-48c901f8b655------2</link>
            <guid isPermaLink="false">https://medium.com/p/bd108b1c9bab</guid>
            <category><![CDATA[promises-in-javascript]]></category>
            <category><![CDATA[javascript]]></category>
            <category><![CDATA[asynchronous-javascript]]></category>
            <dc:creator><![CDATA[kalema ronald]]></dc:creator>
            <pubDate>Sun, 03 Dec 2023 17:45:47 GMT</pubDate>
            <atom:updated>2023-12-04T10:52:09.853Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/900/1*Gti8YR0DA4bWOmo80B_dDA.png" /></figure><p>You may write your program and it is comprised of several chunks (common unit of chunks is a function) which is going to execute now and the rest will execute later. The chunks that cannot complete now will complete asynchronously (later) thus asynchronous programming. Any time you wrap a code into a function and specify that it should be execute in response to some event (event could be a mouse click, timer, response from server), you are creating a later chunk in the code thus Asynchrony.</p><h4>What is a Promise?</h4><p>Imagine this scenario: Dan was told by his father to buy him a bicycle when he gets an A in math. After getting an A in math, Dan asks day and night for a bicycle from his father. To get relief Dan’s father promises to buy him a bicycle next week when he gets the money.</p><p>This is a real life situation for things we have in programming;</p><p>“The producing code” that does something that takes time, that’s Dan’s father.</p><p>“The consuming code” that wants the results once ready from the producing code, that’s Dan.</p><p><strong>A Promise</strong> is an Object returned by an asynchronous function that may complete at some point in the future and produce a value. It notifies the user when its value is available. In otherwise a Promise links the producing code and the consuming code together.</p><p>The syntax for a Promise is:</p><pre>let promise = new Promise(function(resolve, reject) {<br>  // executor (the producing code, &quot;the father&quot;)<br>});</pre><p>The function passed to new Promise is called the <em>executor</em>. When new Promise is created, the executor runs automatically. It contains the producing code which should eventually produce the result. In terms of the scenario above: the executor is the “father”. Its arguments resolve and reject are callbacks provided by JavaScript itself. Our code is only inside the executor. When the executor obtains the result, be it soon or late, it calls one of these callbacks.</p><p>When the executor runs and finishes successfully, resolve(value) will be called and returns the result(value). In our case above the father will return with the bicycle.</p><p>When the executor runs and an error occurs, reject(error) will be called with an error. In our case above the father returns with sad news to his son Dan, “I didn&#39;t get you the bicycle son. I never got the money”.</p><p>Please note, the executor can only return the result or give an error, but not both.</p><p>Example of a Promise;</p><pre>const count = true;<br><br>let countValue = new Promise(function (resolve, reject) {<br>    if (count) {<br>        resolve(&quot;There is a count value.&quot;);<br>    } else {<br>        reject(&quot;There is no count value&quot;);<br>    }<br>});<br><br>console.log(countValue);</pre><p>In the above example, a Promise object is created and stored in the countValue variable. The Promise is resolved (successful) since the count is true . If we change count to false , then the Promise will reject.</p><p><strong>The promise consumers: using then and catch methods</strong></p><p>When the Promise is settled (resolved or rejected), the consumer of the Promise can use it using the then or catch method. in our case scenario above, when the Dan’s father buys him a bicycle, Dan can then ride it(using the then method). but when there is an error, catch method can be used to catch or throw an error.</p><p>.then() method has 2 arguments, first argument is run when the promise resolves or is successful and the second argument runs when the promise rejects or fails. When the Promise resolves, the second argument will be ignored.</p><p>The syntax of then() method is:</p><pre>promise.then(<br>  function(result), // handle a successful result <br>  function(error) // handle an error <br>);</pre><p>Example: promise with .then when there is successful results;</p><pre>let promise = new Promise(function(resolve, reject) {<br>  setTimeout(() =&gt; resolve(&quot;done!&quot;), 1000);<br>});<br><br>// resolve runs the first function in .then<br>promise.then(<br>  result =&gt; alert(result), // shows &quot;done!&quot; after 1 second<br>  error =&gt; alert(error) // doesn&#39;t run<br>);</pre><p>Example: promise with .then when there is an error;</p><pre>let promise = new Promise(function(resolve, reject) {<br>  setTimeout(() =&gt; reject(new Error(&quot;Whoops!&quot;)), 1000);<br>});<br><br>// reject runs the second function in .then<br>promise.then(<br>  result =&gt; alert(result), // doesn&#39;t run<br>  error =&gt; alert(error) // shows &quot;Error: Whoops!&quot; after 1 second<br>);</pre><p><strong>catch method</strong></p><p>If we’re interested only in errors, then we can use null as the first argument: .then(null, errorHandlingFunction). Or we can use .catch(errorHandlingFunction), which is exactly the same as shown in the example below;</p><pre>let promise = new Promise((resolve, reject) =&gt; {<br>  setTimeout(() =&gt; reject(new Error(&quot;Whoops!&quot;)), 1000);<br>});<br><br>// .catch(f) is the same as promise.then(null, f)<br>promise.catch(alert); // shows &quot;Error: Whoops!&quot; after 1 second</pre><p><strong>finally clause on a Promise</strong></p><p>All code in finally clause is executed whether the promise resolves or rejects. The idea of finally is to set up a handler for performing cleanup or finalizing after the previous operations are complete.</p><p>The Example below with finally clause.</p><pre>let promise = new Promise(function(resolve, reject) {<br>  setTimeout(() =&gt; resolve(&quot;done!&quot;), 1000);<br>});<br><br>// resolve runs the first function in .then<br>promise.then(<br>  result =&gt; alert(result), // shows &quot;done!&quot; after 1 second<br>  error =&gt; alert(error) // doesn&#39;t run<br>)<br>.finaly(alert(&quot;finished promise opration&quot;) // allways executed<br>);</pre><p><strong>Promise chaining</strong></p><p>In cases where you want to handle more than one asynchronous task, one after the other. For that we use Promise chaining. Promise Chaining is a simple concept by which we may initialize another promise inside our .then()method and accordingly we may execute our results. The function inside then captures the value returned by the previous promise. For example, in our case scenario above, Dan’s father hands Dan the bicycle, he then promises to give him chocolate every time he washes the bicycle, Dan’s father goes on and promise Dan to watch his favorite TV show after putting inside his washed bicycle.</p><p>The syntax for using promise chaining is shown below;</p><pre>let promise = new Promise((resolve, reject) =&gt; {<br>    resolve(&quot;Hello JavaScript&quot;);<br>    });<br>     <br>    promise<br>    .then( function (result1){<br>        console.log(result1);<br>        return new Promise((resolve,reject) =&gt;{<br>            resolve(&quot;GFG is awesome&quot;);<br>        })<br>    })<br>    .then((result2) =&gt; {<br>        console.log(result2);<br>    });</pre><p>In the syntax above, while executing the declared promise we are returning another promise inside the .then()and executing our results accordingly. Another then is used to capture the new promise. This is known as promise chaining.</p><p><strong>Note:</strong> Several promises can also be declared inside a .then() method and execute the results accordingly.</p><p><strong>Conclusion</strong></p><p>From the above discussion; we can observe that using Promise in asynchronous programming, has a number of benefits such as; simplifying code especially that which involve multiple asynchronous operations, improving the performance of your code by allowing asynchronous operations to be executed in parallel, instead of blocking the execution of the rest of your code.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=bd108b1c9bab" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[HOW TO CHECK IF A GIVEN SET OF DOMINOES CAN BE PLACED IN A ROW USING JAVASCRIPT]]></title>
            <link>https://medium.com/@kalemar8/how-to-check-if-a-given-set-of-dominoes-can-be-placed-in-a-row-using-javascript-6556cdb280e3?source=rss-48c901f8b655------2</link>
            <guid isPermaLink="false">https://medium.com/p/6556cdb280e3</guid>
            <category><![CDATA[problem-solving]]></category>
            <category><![CDATA[programming]]></category>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[javascript]]></category>
            <dc:creator><![CDATA[kalema ronald]]></dc:creator>
            <pubDate>Wed, 25 Oct 2023 09:06:26 GMT</pubDate>
            <atom:updated>2023-10-25T18:58:26.343Z</atom:updated>
            <content:encoded><![CDATA[<p><strong>HOW TO CHECK IF A GIVEN SET OF DOMINOES CAN BE PLACED IN A ROW USING JAVASCRIPT</strong></p><figure><img alt="" src="https://cdn-images-1.medium.com/max/940/1*SH2dyYBPx8XBt9fEM2nTew.png" /></figure><p>During your journey as a programmer, you may have solved many problems and challenges. But the Dominoes challenge is one which your eyes should never skip, because it requires crucial set of programmatic concepts and algorithms. This articles will help you add more skills in your programming journey.</p><p><strong>What are Dominoes</strong></p><p>Dominoes is a family of tile-based games played with gaming pieces. Each domino is a rectangular tile, usually with a line dividing its face into two square ends. Each end is marked with a number of spots (also called <em>pips</em> or <em>dots</em>) or is blank.</p><p><strong>Domino game rules</strong></p><p>The game is normally played in pairs (two against two) and is played as a series of “ends”. In each “end”, the objective is for players to attach a domino from their hand to one end of those already played so that the sum of the end tiles is divisible by five or three. The last number on the tile must be equal to the first number of the second placed tile.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/681/1*uLL9HclszlPJnLjgn4vKEA.png" /></figure><p>Each domino tile presented as an array [x, y] of tile value. dominoes playing any pair [x, y] can also be treated as [y, x].</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/513/1*jt0lR0gHt08HrmuEBVmxVg.png" /></figure><p><strong>How to check if a given set of Dominoes can be placed in a row</strong></p><p>For example given a set of Dominoes [[1,3], [2,3], [1,4], [2,4], [1,5], [2,5]]To check if it can be arranged in a row follow the following steps;</p><p>We start by creating a graph representation of the dominoes and their connections. It uses a Map called graph where each key represents a unique domino value (both ends of the domino), and the associated value is an array of adjacent values. For example, if there is a domino [1, 2], it will add 1 and 2 to the graph and connect them.</p><pre>const graph = new Map();<br><br>for (const [x, y] of dominoes) {<br>    if (!graph.has(x)) {<br>      graph.set(x, []);<br>    }<br>    if (!graph.has(y)) {<br>      graph.set(y, []);<br>    }<br>    graph.get(x).push(y);<br>    graph.get(y).push(x);<br>  }<br>}</pre><p>We then define a recursive function dfs (depth-first search) that is used to traverse the graph starting from a given node. The function keeps track of visited nodes using a Set called visited.</p><p>The function calculates the number of nodes with odd degrees (an odd number of adjacent values) in the graph. In dominoes, valid rows should have either zero or two nodes with odd degrees. If there are any other number of nodes with odd degrees, it means that it’s impossible to create a valid domino row.</p><p>If there are either 0 or 2 nodes with odd degrees, the function checks if the graph is connected. It starts a depth-first search from any unvisited node to explore the entire graph. If the visited nodes cover all nodes in the graph, it means the dominoes can be arranged in a row. Otherwise, it’s not possible to create a valid row.</p><p>The function returns true if it’s possible to arrange the dominoes in a row, and false otherwise.</p><pre>function dfs(node) {<br>    visited.add(node);<br>    for (const neighbor of graph.get(node)) {<br>      if (!visited.has(neighbor)) {<br>        dfs(neighbor);<br>      }<br>    }<br>  }<br><br>  const visited = new Set();<br>  let oddDegreeCount = 0;<br><br>  for (const node of graph.keys()) {<br>    if (graph.get(node).length % 2 !== 0) {<br>      oddDegreeCount++;<br>    }<br>  }<br><br>  // A valid domino row should have either zero or two nodes with odd degrees<br>  if (oddDegreeCount === 0 || oddDegreeCount === 2) {<br>    // Check if the graph is connected<br>    for (const node of graph.keys()) {<br>      if (!visited.has(node)) {<br>        dfs(node);<br>        break;<br>      }<br>    }<br><br>    return visited.size === graph.size;<br>  }</pre><p>Putting all the code together becomes as show below;</p><pre>function canDominoesMakeRow(dominoes) {<br>  const graph = new Map();<br><br>  for (const [x, y] of dominoes) {<br>    if (!graph.has(x)) {<br>      graph.set(x, []);<br>    }<br>    if (!graph.has(y)) {<br>      graph.set(y, []);<br>    }<br>    graph.get(x).push(y);<br>    graph.get(y).push(x);<br>  }<br><br>  function dfs(node) {<br>    visited.add(node);<br>    for (const neighbor of graph.get(node)) {<br>      if (!visited.has(neighbor)) {<br>        dfs(neighbor);<br>      }<br>    }<br>  }<br><br>  const visited = new Set();<br>  let oddDegreeCount = 0;<br><br>  for (const node of graph.keys()) {<br>    if (graph.get(node).length % 2 !== 0) {<br>      oddDegreeCount++;<br>    }<br>  }<br><br>  // A valid domino row should have either zero or two nodes with odd degrees<br>  if (oddDegreeCount === 0 || oddDegreeCount === 2) {<br>    // Check if the graph is connected<br>    for (const node of graph.keys()) {<br>      if (!visited.has(node)) {<br>        dfs(node);<br>        break;<br>      }<br>    }<br><br>    return visited.size === graph.size;<br>  }<br><br>  return false;<br>}<br><br>console.log(canDominoesMakeRow([[1,3], [2,3], [1,4], [2,4], [1,5], [2,5]]))// true</pre><p><strong>Conclusion</strong></p><p>Clearly in this article you have learned how arrange a set of Dominoes using depth first search algorithms, map methods which are very important in solving different problems like this one we have solved.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=6556cdb280e3" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[POKER HAND RANKING USING JAVASCRIPT FUNCTION]]></title>
            <link>https://medium.com/@kalemar8/poker-hand-ranking-using-javascript-function-48a958c96826?source=rss-48c901f8b655------2</link>
            <guid isPermaLink="false">https://medium.com/p/48a958c96826</guid>
            <category><![CDATA[algorithms]]></category>
            <category><![CDATA[poker-hand-ranking]]></category>
            <category><![CDATA[javascript]]></category>
            <category><![CDATA[problem-solving]]></category>
            <dc:creator><![CDATA[kalema ronald]]></dc:creator>
            <pubDate>Tue, 24 Oct 2023 20:51:41 GMT</pubDate>
            <atom:updated>2023-10-24T20:51:41.797Z</atom:updated>
            <content:encoded><![CDATA[<figure><img alt="" src="https://cdn-images-1.medium.com/max/716/1*2KhINyCpbKW5XjCIaA1BHg.png" /><figcaption>playing cards</figcaption></figure><p>INTRODUCTION</p><p>According to Wikipedia, in poker, players form sets of five <a href="https://en.wikipedia.org/wiki/Playing_card">playing cards</a>, called hands, according to the rules of the game. Each hand has a rank, which is compared against the ranks of other hands participating in the showdown to decide who wins the pot. In high games, like Texas hold ’em and seven-card stud, the highest-ranking hands win. In <a href="https://en.wikipedia.org/wiki/Lowball_(poker)">low</a> games, like <a href="https://en.wikipedia.org/wiki/Razz_(poker)">razz</a>, the lowest-ranking hands win. In <a href="https://en.wikipedia.org/wiki/High-low_split">high-low split</a> games, both the highest-ranking and lowest-ranking hands win, though different rules are used to rank the high and low hands</p><p>Each hand belongs to a category determined by the patterns formed by its cards. A hand in a higher-ranking category always ranks higher than a hand in a lower-ranking category. A hand is ranked within its category using the ranks of its cards. Individual cards are ranked, from highest to lowest: A, K, Q, J, 10, 9, 8, 7, 6, 5, 4, 3 and 2 However, aces have the highest rank under <a href="https://en.wikipedia.org/wiki/Ace-to-five_low">ace-to-five</a> high or <a href="https://en.wikipedia.org/wiki/Ace-to-six_low">six-to-ace</a> low rules, or under high rules as part of a five-high straight or straight flush <a href="https://en.wikipedia.org/wiki/Suit_(cards)">Suits</a> are not ranked, so hands that differ by suit alone are of equal rank</p><p>POKER HAND RANKING</p><p>List of Poker hand ranking from strongest to weakest include;</p><ol><li>Royal flush</li></ol><figure><img alt="" src="https://cdn-images-1.medium.com/max/800/1*YFxa3LUtrSqp0VvUhXQK1w.png" /></figure><p>The royal flush is the best hand available in poker. It features five consecutive cards, all of the same suit, in order of value from 10 through to ace.</p><p>2. Straight flush</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/792/1*0CvOZ4zQLnAkomqw4qxrvg.png" /></figure><p>Any five cards of successive values in the same suit that’s not a royal flush is a straight flush. A royal flush or a straight flush with cards of higher ranking are the only hands that can beat a straight flush.</p><p>3. Four of a kind</p><p>Four of the same card in the four suits. The five-card hand is completed by the highest card among the others on the table or in your hand.</p><p>4. Full house</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/789/1*zXULAon5wT-u-cXjyQPv8g.png" /></figure><p>Three of the same value card in three different suits plus a different pair of the same rank card in two different suits in one hand. If more than just one player has a full house the player with the highest value three of a kind will win the hand.</p><p>5. Flush</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/795/1*7SK2MkJOQ5mP9d6a5gkV1A.png" /></figure><p>Five cards of the same suit in no particular order. If more than one player has a flush, the hand with the highest valued card will win.</p><p>6. Straight</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/792/1*yLb5vsuUnOgfJdbZrzKdvw.png" /></figure><p>Five cards of consecutive numerical value composed of more than one suit. An ace can normally rank as low (below a 2) or high (above a king) but not at the same time in one hand.</p><p>7. Three of a kind</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/798/1*eoFCXb8b-YkUoX20CN5WYg.png" /></figure><p>A poker hand containing three cards of the same rank in three different suits. The two highest available cards besides the three of a kind complete the hand.</p><p>8. Two pair</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/789/1*SB3e5hp20q--81eUMnX-AQ.png" /></figure><p>Two different sets of two cards of matching rank. The highest-ranked left available card completes the hand.</p><p>9. A pair</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/791/1*DR7ckd24wDluvM3QdLV9lg.png" /></figure><p>A pair of cards of the same rank in different suits. The remainder of the hand is formed from the three highest-ranked cards available.</p><p>10. High card</p><p>The lowest-ranked hand available. The highest card in the hand is your ‘best hand’. In this case it’s the king of clubs.</p><p>IMPLEMENTING THE POKER HAND RANKING FUNCTION</p><p>We are going to rank the poker hand, for example hand = [ ‘A♥’,’K♥’,’Q♥’,’2♦’,’3♠’ ].</p><p>We shall start by joining the elements of the hand array into a single string, handOne, where cards are separated by spaces.</p><p>const handOne = hand.join(“ “);</p><p>We then initialize two empty arrays, rankArray and suitArray, to store the ranks and suits of the cards in the hand, respectively.</p><p>let rankArray = [];</p><p>let suitArray = [];</p><p>The ranks array which defines the possible ranks of cards in a standard deck of cards is initialized</p><p>const ranks = [“2”, ”3&quot;, ”4&quot;, ”5&quot;, ”6&quot;, ”7&quot;, ”8&quot;, ”9&quot;, ”10&quot;, ”J”, ”Q”, ”K”, ”A”];</p><p>We can then sort the cards in the hand based on their ranks using the sorted function. It iterates through the ranks and for each rank, it finds and appends the corresponding card from the hand to the sortedHandOne array.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/620/1*WMc3rfuuHuKW6HOu_0hieA.png" /></figure><p>We then extract the rank and suit of each card in the sortedHandOne array using the suitAndRank function</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/614/1*V6iSVaARBxvxBG64ZOq5eA.png" /></figure><p>We then count the occurrences of each suit in the suitArray and also count occurrences of each rank in the RankArray using the countSuits and countRanks functions respectively.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/610/1*kH0uN4AP0kFlPRoYlG7rTA.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/609/1*YkB3v4VxwCwIvVq-8kkNWA.png" /></figure><p>We then check if all the cards in the hand have the suit, which indicates a flush. We also check if the hand forms a straight, which is a sequence of consecutive ranks. The number of pair in the hand are also counted using the pairs function.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/615/1*VVlOdMPiLIg-Cze9YwfCeA.png" /></figure><p>The whichHand function then determines the poker hand rank based on the evaluated conditions. It checks for specific combinations, such as straight flush, four of a kind, full house, flush, straight, three of a kind, two pairs, one pair, and high card. If none of these conditions are met, it defaults to a high card.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/666/1*oFWNBqGSzAfX2hBw7aJ1qQ.png" /></figure><p>Putting all the code together;</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/609/1*tb56sx2Nk1HBu9HN7QCKiQ.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/607/1*9TwyLGXP6MFKBUlydfiNlg.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/546/1*qewmNkxggnxZiUB2rB_0Nw.png" /></figure><figure><img alt="" src="https://cdn-images-1.medium.com/max/611/1*03TS-YADHoZtGQjQdCjmAw.png" /></figure><p>Sample examples include;</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/612/1*GZx8QfY9NOd6576TGwy8Dw.png" /></figure><p>CONCLUSION</p><p>As you can see, if we break down the problem, Poker hand ranking can be implemented using the above function.</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=48a958c96826" width="1" height="1" alt="">]]></content:encoded>
        </item>
        <item>
            <title><![CDATA[MY JOURNEY TO SOFTWARE DEVELOPMENT]]></title>
            <link>https://medium.com/@kalemar8/my-journey-to-software-development-c928d23ba5bd?source=rss-48c901f8b655------2</link>
            <guid isPermaLink="false">https://medium.com/p/c928d23ba5bd</guid>
            <category><![CDATA[about-me]]></category>
            <category><![CDATA[software-development]]></category>
            <category><![CDATA[kanzucodefoundation]]></category>
            <dc:creator><![CDATA[kalema ronald]]></dc:creator>
            <pubDate>Mon, 24 Jul 2023 12:46:07 GMT</pubDate>
            <atom:updated>2023-07-24T12:46:07.336Z</atom:updated>
            <content:encoded><![CDATA[<p>MY JOURNEY TO SOFTWARE DEVELOPMENT</p><p>My name is Kalema Ronald, a passionate software Developer. The journey to Software development, has been an exhilarating journey of self-discovery, filled with curiosity, challenges, and the thrill of conquering the digital frontier.</p><p>I must confess that my fascination with technology began at an early age. As a child, I was endlessly captivated by the magical world that unfolded through the screen of a computer. The thought that lines of code could breathe life into digital landscapes and shape the way we interact with the world ignited a spark within me. This realization marked the genesis of my unyielding passion for technology and set me on the path to becoming a software developer.</p><figure><img alt="" src="https://cdn-images-1.medium.com/max/1024/1*1a1YOI4ro1BX82wTzMJ3LA.jpeg" /></figure><p>As I delved deeper into the realm of programming, I was struck by the vast array of possibilities it presented. The ability to create something tangible, to transform abstract concepts into functioning software, fueled my creativity and fostered an innate desire to build solutions that could make a positive impact on people’s lives.</p><p>Throughout my academic journey, I voraciously consumed knowledge on software development, computer science, and related disciplines. Each programming language and algorithm unraveled before me like a puzzle, and with every piece I mastered, my excitement grew. The beauty of software development lies in its constant evolution, pushing developers to be lifelong learners. I embraced this aspect, relishing the opportunity to stay up-to-date with the latest advancements and best practices.</p><p>But above all, what truly motivates me to continue on this path is the potential for positive impact. Software has the power to enhance education, improve healthcare, transform businesses, and even address societal challenges. Witnessing how a simple application can simplify a task or improve efficiency is immensely gratifying, and it drives me to contribute my skills and expertise to create meaningful change.</p><p>As I conclude this humble introduction, I feel a renewed sense of purpose in my journey as a software developer. The road ahead is brimming with possibilities and challenges, and I am eager to face them head-on, armed with my passion, skills, and an unwavering determination to make a difference.</p><p>Thank you for joining me on this expedition. Let’s embark together on a voyage of innovation, learning, and growth as we navigate the ever-evolving world of software development.</p><p>Until next time</p><p>Kalema Ronald</p><img src="https://medium.com/_/stat?event=post.clientViewed&referrerSource=full_rss&postId=c928d23ba5bd" width="1" height="1" alt="">]]></content:encoded>
        </item>
    </channel>
</rss>